Approximate and dynamic rank aggregation

DOI10.1016/j.tcs.2004.02.043zbMath1143.91322OpenAlexW2032884539MaRDI QIDQ1884843

Shanfeng Zhu, Qizhi Fang, Francis Y. L. Chin, Xiaotie Deng

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.02.043

zbMATH Keywords

CoherenceKendall-\(\tau\) distanceRank aggregationWeighted ECC

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25) Social choice (91B14)

Related Items

On the complexity of crossings in permutations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Median linear orders: Heuristics and a branch and bound algorithm
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• Voting schemes for which it can be difficult to tell who won the election
• The median procedure in cluster analysis and social choice theory
• New results on the computation of median orders
• Approximate sequencing for variable length tasks.
• A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
• A Chernoff Bound for Random Walks on Expander Graphs