Name
Abstract | ||
|---|---|---|
The Kemeny Scoreproblem 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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-68880-8_8 | AAIM |
Keywords | Field | DocType |
input permutation,optimal score,consensus permutation,longer permutation,fixed-parameter tractability result,kemeny scores,overall distance,optimal consensus permutation,fixed-parameter algorithms,maximum distance,fixed-parameter algorithm,kemeny scoreproblem | Combinatorics,Mathematical optimization,Computer science,Permutation,Algorithm | Conference |
Volume | ISSN | Citations |
5034 | 0302-9743 | 23 |
PageRank | References | Authors |
1.19 | 13 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nadja Betzler | 1 | 501 | 24.69 |
| Michael R. Fellows | 2 | 4138 | 319.37 |
| Jiong Guo | 3 | 1493 | 88.91 |
| Rolf Niedermeier | 4 | 3465 | 234.21 |
| Frances A. Rosamond | 5 | 304 | 15.94 |