Fixed-parameter algorithms for Kemeny rankings
From MaRDI portal
Publication:1035688
DOI10.1016/j.tcs.2009.08.033zbMath1179.91062WikidataQ57359797 ScholiaQ57359797MaRDI QIDQ1035688
Michael R. Fellows, Rolf Niedermeier, Frances A. Rosamond, Jiong Guo, Nadja Betzler
Publication date: 4 November 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.08.033
winner determination; fixed-parameter tractability; computational social choice; rank aggregation; voting systems; consensus finding
91B12: Voting theory
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)