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

• Type: Conference
• Year: 2007
• Where: STOC
• Authors: Claire Kenyon-Mathieu, Warren Schudy
• Keywords: Algorithms, Max Acyclic Subgraph, Simple Weighted Generalization, STOC 2007, Structures General Terms