99 search results - page 4 / 20 » Directed Feedback Vertex Set Problem is FPT |
ICTCS
2007
Springer
13 years 12 months ago
2007
Springer
DAGSTUHL
2007
13 years 7 months ago
2007
WADS
2005
Springer
13 years 11 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...
TAMC
2009
Springer
2009
Springer
Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments
14 years 8 days ago
We consider the feedback vertex set and feedback arc set problems in bipartite tournaments. We improve on recent results by giving a 2-approximation algorithm for the feedback vert...
CIAC
2006
Springer
13 years 9 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...