Improved fixed-parameter algorithms for two feedback set problems

Lecture Notes in Computer Science

Volumn 3608, Issue , 2005, Pages 158-168

  Guo, Jiong ^a   Gramm, Jens ^b   Hüffner, Falk ^a   Niedermeier, Rolf ^a   Wernicke, Sebastian ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^b UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; PROBLEM SOLVING; SET THEORY;

FEEDBACK SET PROBLEMS; FEEDBACK VERTEX SET; FIXED-PARAMETER ALGORITHMS;

ALGORITHMS;

EID: 26844485105     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11534273_15     Document Type: Conference Paper

References (23)

1. V. Bafna, P. Berman, and T. Fujito. A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM Journal on Discrete Mathematics, 3(2):289-297, 1999.
2. R. Bar-Yehuda, D. Geiger, J. Naor, and R. M. Roth. Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference. SIAM Journal on Computing, 27(4):942-959, 1998.
3. A. Becker, R. Bar-Yehuda, and D. Geiger. Randomized algorithms for the Loop Cutset problem. Journal of Artificial Intelligence Research, 12:219-234, 2000.
4. H. L. Bodlaender. On disjoint cycles. International Journal of Foundations of Computer Science, 5:59-68, 1994.
5. O(k)) FPT algorithm for the undirected feedback vertex set problem. In Proc. 11th COCOON, LNCS. Springer, Aug. 2005.
6. R. G. Downey and M. R. Fellows. Fixed-parameter tractability and completeness. Congressus Numerantium, 87:161-187, 1992.
7. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.
8. M. R. Fellows. New directions and new challenges in algorithm design and complexity, parameterized. In Proc. 8th WADS, volume 2748 of LNCS, pages 505-520. Springer, 2003.
9. P. Festa, P. M. Pardalos, and M. G. C. Resende. Feedback set problems. In D. Z. Du and P. M. Pardalos, editors, Handbook of Combinatorial Optimization, Vol. A, pages 209-258. Kluwer, 1999.
10. S. Fiorini, N. Hardy, B. Reed, and A. Vetta. Planar graph bipartization in linear time. In Proc. 2nd GRACO, Electronic Notes in Discrete Mathematics, 2005.
11. N. Garg, V. V. Vazirani, and M. Yannakakis. Approximate max-flow min(multi)cut theorems and their applications. SIAM Journal on Computing, 25(2):235-251, 1996.
12. F. Hüffner. Algorithm engineering for optimal graph bipartization. In Proc. 4th WEA, volume 3503 of LNCS, pages 240-252. Springer, 2005.
13. A. B. Kahng, S. Vaya, and A. Zelikovsky. New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout. In Proc. Asia and South Pacific Design Automation Conference, pages 133-138, 2001.
14. I. Kanj, M. Pelsmajer, and M. Schaefer. Parameterized algorithms for feedback vertex set. In Proc. 1st IWPEC, volume 3162 of LNCS, pages 235-247. Springer, 2004.
15. C. Lund and M. Yannakakis. The approximation of maximum subgraph problems. In Proc. 20th ICALP, volume 700 of LNCS, pages 40-51. Springer, 1993.
16. R. Niedermeier. Ubiquitous parameterization - invitation to fixed-parameter algorithms. In Proc. 29th MFCS, volume 3153 of LNCS, pages 84-103. Springer, 2004.
17. R. Niedermeier. Invitation to Fixed-Parameter Algorithms. Oxford University Press, forthcoming, 2005.
18. C. H. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. Journal of Computer and System Sciences, 43:425-440, 1991.
19. M. Pop, D. S. Kosack, and S. L. Salzberg. Hierarchical scaffolding with Bambus. Genome Research, 14:149-159, 2004.
20. V. Raman, S. Saurabh, and C. R. Subramanian. Faster fixed parameter tractable algorithms for undirected feedback vertex set. In Proc. 13th ISAAC, volume 2518 of LNCS, pages 241-248. Springer, 2002.
21. V. Raman, S. Saurabh, and C. R. Subramanian. Faster algorithms for feedback vertex set. In Proc. 2nd GRACO, Electronic Notes in Discrete Mathematics, 2005.
22. B. Reed, K. Smith, and A. Vetta. Finding odd cycle transversals. Operations Research Letters, 32:299-301, 2004.
23. S. Wernicke. On the algorithmic tractability of single nucleotide polymorphism (SNP) analysis and related problems. Diplomarbeit, WSI für Informatik, Universität Tübingen, 2003.