464 search results - page 1 / 93 » Improved Fixed-Parameter Algorithms for Two Feedback Set Pro... |
WADS
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. Settling a ten years open question, we show that the NPcomplete Feedback Vertex Set problem is deterministically solvable in O(ck ·m) time, where m denotes the number of...
CIAC
2006
Springer
14 years 2 months ago
2006
Springer
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
IJCGA
2008
13 years 11 months ago
2008
Published as Technical Report LU-CS-TR:2005-238 on February 13, 2006, ISSN 1650-1276 Report 158, Lund University, Sweden 2006 We discuss and compare four fixed parameter algorithm...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
Consider a set of labels L and a set of trees T = {T (1) , T (2) , . . . , T (k) } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is ...
AAIM
2008
Springer
14 years 5 months ago
2008
Springer
The Kemeny Score problem is central to many applications in the context of rank aggregation. Given a set of permutations (votes) over a set of candidates, one searches for a “con...