Parameterized Enumeration of Neighbour Strings and Kemeny Aggregations
In 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 g...
Main Author: | |
---|---|
Language: | en |
Published: |
2013
|
Subjects: | |
Online Access: | http://hdl.handle.net/10012/7774 |