Parameterized approximability of the disjoint cycle problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4596 LNCS, Issue , 2007, Pages 363-374

  Grohe, Martin ^a   Grüber, Magdalena ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Approximation algorithms; Fixed parameter treatability; Parameterized complexity theory

Indexed keywords

COMPUTATIONAL COMPLEXITY; PARAMETER ESTIMATION; PROBLEM SOLVING;

FIXED PARAMETER TREATABILITY; PARAMETERIZED COMPLEXITY THEORY;

APPROXIMATION ALGORITHMS;

EID: 38149049172     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73420-8_33     Document Type: Conference Paper

References (21)

1. Alon, N.: Disjoint directed cycles. Journal of Combinatorial Theory Series B 68(2), 167-178 (1996)
2. Bang-Jensen, J., Gutin, G.: Digraphs. Springer, Heidelberg (2002)
3. Cai, L., Huang, X.: Fixed-parameter approximation: Conceptual framework and approximability results. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 96-108. Springer, Heidelberg (2006)
4. Chen, Y., Grohe, M., Grüber, M.: On parameterized approximability. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 109-120. Springer, Heidelberg (2006)
5. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
6. Downey, R.G., Fellows, M.R., McCartin, C.: Parameterized approximation algorithms. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 121-129. Springer, Heidelberg (2006)
7. Erdös, P., Pósa, L.: On the independent circuits contained in a graph. Canadian Journal of Mathematics 17, 347-352 (1965)
8. Even, G., Naor, J.S., Schieber, B., Sudan, M.: Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica 20(2), 151-174 (1998)
9. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
10. Graham, R.L., Grötschel, M., Lovász, L. (eds.): Handbook of Combinatorics (volume II, chapter Ramsey theory), pp. 1331-1403. Elsevier Science, Amsterdam (1995)
11. Grötschel, M., Lovasz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization, 2nd edn. Springer, Heidelberg (1993)
12. Guenin, B., Thomas, R.: Packing directed circuits exactly. To appear in Combinatorica (2006)
13. Gutin, G., Yeo, A.: Some parameterized problems on digraphs (Submitted 2006)
14. Marx, D.: Parameterized complexity and approximation algorithms. To appear in The Computer Journal (2006)
15. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)
16. Reed, B., Robertson, N., Seymour, P., Thomas, R.: Packing directed circuits. Combinatorica 16(4), 535-554 (1996)
17. Reed, B., Shepherd, F.: The gallai-younger conjecture for planar graphs. Combinatorica 16(4), 555-566 (1996)
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)
19. Seymour, P.: Packing directed circuits fractionally. Combinatorica 15(2), 281-288 (1995)
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)
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)