Sciweavers

Share
STOC
2007
ACM

How to rank with few errors

10 years 10 months ago
How to rank with few errors
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung rank aggregation. Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems--Computations on discrete structures General Terms Algorithms, Theory Keywords Approximation algorithm, Feedback arc set, Kemeny-Young rank aggregation, Max acyclic subgraph, Polynomial-time approximation scheme, Tournament graphs
Claire Kenyon-Mathieu, Warren Schudy
Added 03 Dec 2009
Updated 03 Dec 2009
Type Conference
Year 2007
Where STOC
Authors Claire Kenyon-Mathieu, Warren Schudy
Comments (0)
books