Abstract
The Kemeny Score problem is central to many applications in the context of rank aggregation. Given a set of permutations (votes) over a set of candidates, one searches for a "consensus permutation" that is "closest" to the given set of permutations. Computing an optimal consensus permutation is NP-hard. We provide first, encouraging fixed-parameter tractability results for computing optimal scores (that is, the overall distance of an optimal consensus permutation). Our fixed-parameter algorithms employ the parameters "score of the consensus", "maximum distance between two input permutations", and "number of candidates". We extend our results to votes with ties and incomplete votes, thus, in both cases having no longer permutations as input. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Betzler, N., Fellows, M. R., Guo, J., Niedermeier, R., & Rosamond, F. A. (2008). Fixed-parameter algorithms for kemeny scores. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5034 LNCS, pp. 60–71). https://doi.org/10.1007/978-3-540-68880-8_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
