Fixed-Parameter Algorithms for Kemeny Scores

DOI10.1007/978-3-540-68880-8_8zbMath1143.91319OpenAlexW2095940121WikidataQ57359881 ScholiaQ57359881MaRDI QIDQ3511416

Rolf Niedermeier, Nadja Betzler, Jiong Guo, Frances A. Rosamond, Michael R. Fellows

Publication date: 10 July 2008

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68880-8_8

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Voting theory (91B12)

Related Items

A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings, Parameterized Computational Complexity of Dodgson and Young Elections, Ranking and Drawing in Subexponential Time, Parameterizing above or below guaranteed values, Iterative Compression for Exactly Solving NP-Hard Minimization Problems, Fixed-parameter algorithms for Kemeny rankings, Improved Parameterized Algorithms for the Kemeny Aggregation Problem, Parameterized complexity of candidate control in elections and related digraph problems

Cites Work

• The complexity of Kemeny elections
• Voting schemes for which it can be difficult to tell who won the election
• Improved fixed parameter tractable algorithms for two ``edge problems: MAXCUT and MAXDAG
• Parametrized complexity theory.
• Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
• Aggregating inconsistent information
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item