Parameterized Approximability of the Disjoint Cycle Problem
- 1k Downloads
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.
Keywordsapproximation algorithms fixed-parameter tractability parameterized complexity theory
Unable to display preview. Download preview PDF.
- 5.Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)Google Scholar
- 9.Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)Google Scholar
- 12.Guenin, B., Thomas, R.: Packing directed circuits exactly. To appear in Combinatorica (2006) Google Scholar
- 13.Gutin, G., Yeo, A.: Some parameterized problems on digraphs (Submitted 2006)Google Scholar
- 14.Marx, D.: Parameterized complexity and approximation algorithms. To appear in The Computer Journal (2006)Google Scholar
- 18.Salavatipour, M., Verstraete, J.: Disjoint cycles: Integrality gap, hardness, and approximation. In: Jünger, M., Kaibel, V. (eds.) Integer Programming and Combinatorial Optimization. LNCS, vol. 3509, pp. 51–65. Springer, Heidelberg (2005)Google Scholar
- 20.Slivkins, A.: Parameterized tractability of edge-disjoint paths on directed acyclic graphs. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 482–493. Springer, Heidelberg (2003)Google Scholar
- 21.Younger, D.: Graphs with interlinked directed circuits. In: Proceedings of the Midwest Symposium on Circuit Theory 2, pages XVI 2.1–XVI 2.7 (1973)Google Scholar