Sciweavers

10 search results - page 2 / 2
» Kernels for Feedback Arc Set In Tournaments
Sort
View
CPC
2007
68views more  CPC 2007»
13 years 5 months ago
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
Pierre Charbit, Stéphan Thomassé, An...
IPL
2007
77views more  IPL 2007»
13 years 5 months ago
Feedback arc set in bipartite tournaments is NP-complete
Jiong Guo, Falk Hüffner, Hannes Moser
WAOA
2010
Springer
275views Algorithms» more  WAOA 2010»
13 years 3 months ago
Online Ranking for Tournament Graphs
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...
Claire Mathieu, Adrian Vladu
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
14 years 5 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
ICALP
2009
Springer
14 years 5 months ago
Fast FAST
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...
Noga Alon, Daniel Lokshtanov, Saket Saurabh