The undirected feedback vertex set problem has a poly(k) kernel

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

Volumn 4169 LNCS, Issue , 2006, Pages 192-202

  Burrage, Kevin ^a   Estivill Castro, Vladimir ^b   Fellows, Michael ^c   Langston, Michael ^d,e   Mac, Shev ^a   Rosamond, Frances ^f  

^a UNIVERSITY OF QUEENSLAND   (Australia)

^b GRIFFITH UNIVERSITY   (Australia)

^c UNIVERSITY OF NEWCASTLE   (Australia)

^d University of Tennessee Knoxville   (United States)

^e OAK RIDGE NATIONAL LABORATORY   (United States)

^f Retreat for the Arts and Sciences   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECISION THEORY; NUMBER THEORY; POLYNOMIALS; PROBLEM SOLVING;

KERNELIZATION BOUND; POLYNOMIAL FUNCTIONS; POLYNOMIAL TIME;

SET THEORY;

EID: 33750233301     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11847250_18     Document Type: Conference Paper

References (29)

1. [ACFLSS04] F. N. Abu-Khzam, R. L. Collins, M. R. Fellows, M. A. Langsten, W. H. Suters and C. T. Symons. Kernelization algorithms for the vertex cover problem: theory and experiments. Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, January, 2004, ACM/SIAM, Proc. Applied Mathematics 115, L. Arge, G. Italiano and R. Sedgewick, eds.
2. [AFN04] J. Alber, M. Fellows and R. Niedermeier. Polynomial time data reduotion for dominating set. Journal of the ACM 51 (2004), 363-384.
3. [BBF99] V. Bafna, P. Berman and T. Fujito. A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM Journal on Discrete Mathematics 12 (1999), 289-297.
4. [BBG00] A. Becker, R. Bar-Yehuda and D. Geiger. Random algorithms for the loop cutset problem. Journal of Artificial Intelligence Research 12 (2000). 219-234.
5. [BKV05] H. Bodlaender, A. Koster and F. van den Eijkhof. Preprocessing rules for triangulation of probabilistic networks. Computational Intelligence 21 (2005), 286-305.
6. [Bod94] H. Bodlaender. On disjoint cycles. International Journal of Foundations of Computer Science 5 (1994), 59-68.
7. 2) steps. Proceedings W G 2004, Springer-Verlag, Lecture Notes in Computer Science 3353 (2004), 257-269.
8. [DF92] R. Downey and M. Fellows. Fixed-parameter tractability and completeness. Congressus Numerantium 87 (1992), 161-187.
9. [DF99] R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer-Verlag, 1999.
10. O(k)) FPT algorithm for the undirected feedback vertex set problem. In: Proceedings COCOON 2005, Springer-Verlag, Lecture Notes in Computer Science 3595 (2005), 859-869.
11. [DFRS04] F. Dehne, M. Fellows, F. Rosamond and P. Shaw. Greedy localization, iterative compression and modeled crown reductions: new FPT techniques, an improved algorithm for set splitting and a novel 2k kernelization for vertex cover. Proceedings of the First International Workshop on Parameterized and Exact Computation, Springer-Verlag, Lecture Notes in Computer Science vol. 3162 (2004), 271-280.
12. [FG06] Parameterized Complexity Theory, J. Flum and M. Grohe, Springer-Verlag, 2006.
13. 2 n nondeterministic bits. Proceedings of the 31st ICALP, Springer-Verlag, Lecture Notes in Computer Science 3142 (2004), 555-567.
14. [FPR99] P. Festa, P. M. Pardalos and M. G. C. Resende. Feedback set problems. In: D. Z. Du, P. M. Pardalos (Eds.), Handbook of Combinatorial Optimization, Vol. A, Kluwer (1999), 209-258.
15. [GGHNW05] J. Guo, J. Gramm, F. Hueffner, R. Niedermeier, S. Wernicke. Improved fixed-parameter algorithms for two feedback set problems. Proceedings of WADS 2005, Springer-Verlag, Lecture Notes in Computer Science 3608 (2005), 158-169.
16. [GJ79] M. R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
17. [Guo06] J. Guo. Algorithm design techniques for parameterized problems. Ph.D. Thesis, Friedrich-Schiller-Universität, Jena, 2006.
18. [KPS04] I. Kanj, M. Pelsmajer and M. Schaefer. Parameterized algorithms for feedback vertex set. Proceedings of the First International Workshop on Parameterized and Exact Computation, Springer-Verlag, Lecture Notes in Computer Science vol. 3162 (2004), 235-247.
19. [LS05] D. Lokshtanov and C. Sloper. Fixed-parameter set-splitting, linear kernel and improved running time. In: Algorithms and Complexity in Durham 2005: Proceedings of the First ACiD Workshop, King's College Press, Texts in Algorithmes 4 (2005), 105-113.
20. [Nie02] R. Niedermeier. Invitation to fixed-parameter algorithms, Habilitation-schrift, University of Tubingen, 2002. (Electronic file available from R. Niedermeier.)
21. [Nie06] R. Niedermeier. Invitation to Fixed Parameter Algorithms. Oxford University Press, 2006.
22. [NT75] G. L. Nemhauser and L. E. Trotter. Vertex packings: structural properties and algorithms. Mathematical Programming 8 (1975), 232-248.
23. [Pr05] E. Prieto-Rodriguez. Systematic kernelization in FPT algorithm design. Ph.D. Thesis, School of EE&CS, University of Newcastle, Australia, 2005.
24. [RSS02] V. Raman, S. Saurabh and C. Subramanian. Faster fixed-parameter tractable algorithms for undirected feedback vertex set. In Proceedings of the 13th Annual International Symposium on Algorithms and Computation, Springer, Lecture Notes in Computer Science vol. 2518 (2002), 241-248.
25. [RSS05] V. Raman, S. Saurabh and C.R. Subramanian. Faster algorithms for feedback vertex set. In: Proceedings of the 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics, GRACO 2005, April 27-29, 2005, Angra dos Reis (Rio de Janeiro), Brazil. Elsevier, Electronic Notes in Discrete Mathematics (2005).
26. [Slo05] C. Sloper. Techniques in parameterized algorithm design. Ph.D. Thesis, Department of Informatics, University of Bergen, Norway, 2005.
27. [Wei98] K. Weihe. Covering trains by stations, or the power of data reduction. Proc. ALEX'98 (1998), 1-8.
28. [Wei00] K. Weihe, "On the Differences Between 'Practical' and 'Applied' (invited paper)," Proc. WAE 2000, Springer-Verlag, Lecture Notes in Computer Science 1982 (2001), 1-10.
29. poly(k). Proceedings of 1st IWPEC, Springer-Verlag, Lecture Notes in Computer Science 3164 (2004), 49-60.