Sciweavers

Share
ECCC
2006
109views more  ECCC 2006»
9 years 10 months ago
How to rank with few errors: A PTAS for Weighted Feedback Arc Set on Tournaments
Suppose you ran a chess tournament, everybody played everybody, and you wanted to use the results to rank everybody. Unless you were really lucky, the results would not be acyclic...
Claire Kenyon-Mathieu, Warren Schudy
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
10 years 11 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 ran...
Claire Kenyon-Mathieu, Warren Schudy
books