12 search results - page 3 / 3 » The Minimum Feedback Arc Set Problem is NP-Hard for Tourname... |
CORR
2011
Springer
13 years 3 months ago
2011
Springer
In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxiliary alg...
ICALP
2009
Springer
14 years 8 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...