Advertisement
Published in:
2007 | OriginalPaper | Chapter
Parameterized Approximability of the Disjoint Cycle Problem
Authors : Martin Grohe, Magdalena Grüber
Published in: Automata, Languages and Programming
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph
G
with
n
vertices and a positive integer
k
, the algorithm constructs a family of at least
k
/
ρ
(
k
) disjoint cycles of
G
if the graph
G
has a family of at least
k
disjoint cycles (and otherwise may still produce a solution, or just report failure). Here
ρ
is a computable function such that
k
/
ρ
(
k
) is nondecreasing and unbounded. The running time of our algorithm is polynomial.
The directed vertex disjoint cycle problem is hard for the parameterized complexity class W1, and to the best of our knowledge our algorithm is the first fpt approximation algorithm for a natural W1-hard problem.