Parameterized Enumeration of Neighbour Strings and Kemeny Aggregations

dc.contributor.authorSimjour, Narges
dc.date.accessioned2013-08-30T13:43:42Z
dc.date.available2013-08-30T13:43:42Z
dc.date.issued2013-08-30T13:43:42Z
dc.date.submitted2013
dc.description.abstractIn this thesis, we consider approaches to enumeration problems in the parameterized complexity setting. We obtain competitive parameterized algorithms to enumerate all, as well as several of, the solutions for two related problems Neighbour String and Kemeny Rank Aggregation. In both problems, the goal is to find a solution that is as close as possible to a set of inputs (strings and total orders, respectively) according to some distance measure. We also introduce a notion of enumerative kernels for which there is a bijection between solutions to the original instance and solutions to the kernel, and provide such a kernel for Kemeny Rank Aggregation, improving a previous kernel for the problem. We demonstrate how several of the algorithms and notions discussed in this thesis are extensible to a group of parameterized problems, improving published results for some other problems.en
dc.identifier.urihttp://hdl.handle.net/10012/7774
dc.language.isoenen
dc.pendingfalseen
dc.publisherUniversity of Waterlooen
dc.subjectParameterized complexityen
dc.subjectEnumerationen
dc.subject.programComputer Scienceen
dc.titleParameterized Enumeration of Neighbour Strings and Kemeny Aggregationsen
dc.typeDoctoral Thesisen
uws-etd.degreeDoctor of Philosophyen
uws-etd.degree.departmentSchool of Computer Scienceen
uws.peerReviewStatusUnrevieweden
uws.scholarLevelGraduateen
uws.typeOfResourceTexten

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Simjour_Narges.pdf
Size:
1.1 MB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
254 B
Format:
Item-specific license agreed upon to submission
Description: