10 search results - page 2 / 2 » Feedback arc set in bipartite tournaments is NP-complete |
ECCC
2006
13 years 5 months ago
2006
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...
CPC
2007
13 years 5 months ago
2007
WAOA
2010
Springer
13 years 3 months ago
2010
Springer
We study the problem of producing a global ranking of items given pairwise ranking information, when the items to be ranked arrive in an online fashion. We study both the maximizat...
STOC
2007
ACM
14 years 6 months ago
2007
ACM
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...
ICALP
2009
Springer
14 years 6 months ago
2009
Springer
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...