Vertex cover kernelization revisited: Upper and lower bounds for a refined parameter

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 9, Issue , 2011, Pages 177-188

  Jansen, Bart M P ^a   Bodlaender, Hans L ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Kernelization; Lower bounds; Parameterized complexity

Indexed keywords

COMBINATORIAL STRUCTURES; KERNELIZATION; LOWER BOUNDS; MINIMUM FEEDBACK VERTEX SET; PARAMETERIZED COMPLEXITY; POLYNOMIAL HIERARCHIES; PRE-PROCESSING ALGORITHMS; UPPER AND LOWER BOUNDS;

ALGORITHMS; POLYNOMIAL APPROXIMATION;

COMPUTER SCIENCE;

EID: 84880258936     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.STACS.2011.177     Document Type: Conference Paper

References (32)

1. Faisal N. Abu-Khzam, Rebecca L. Collins, Michael R. Fellows, Michael A. Langston, W. Henry Suters, and Christopher T. Symons. Kernelization algorithms for the vertex cover problem: Theory and experiments. In Proc. 6th ALENEX/ANALC, pages 62-69, 2004.
2. Faisal N. Abu-Khzam, Michael R. Fellows, Michael A. Langston, and W. Henry Suters. Crown structures for vertex cover kernelization. Theory Comput. Syst., 41(3):411-430, 2007.
3. Vineet Bafna, Piotr Berman, and Toshihiro Fujito. A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM Journal on Discrete Mathematics, 12(3):289-297, 1999.
4. Hans L. Bodlaender, Bart M. P. Jansen, and Stefan Kratsch. Cross-composition: A new technique for kernelization lower bounds. CoRR, abs/1011.4224, 2010.
5. Hans L. Bodlaender, Stéphan Thomassé, and Anders Yeo. Kernel bounds for disjoint cycles and disjoint paths. In Proc. 17th ESA, pages 635-646, 2009.
6. Jonathan F. Buss and Judy Goldsmith. Nondeterminism within P. SIAM J. Comput., 22(3):560-572, 1993.
7. Leizhen Cai. Parameterized complexity of vertex colouring. Discrete Applied Mathematics, 127(3):415-429, 2003.
8. Jianer Chen, Iyad A. Kanj, and Weijia Jia. Vertex cover: Further observations and further improvements. J. Algorithms, 41(2):280-301, 2001.
9. Jianer Chen, Iyad A. Kanj, and Ge Xia. Improved parameterized upper bounds for vertex cover. In Proc. 31st MFCS, pages 238-249, 2006.
10. Miroslav Chlebík and Janka Chlebíková. Crown reductions for the minimum weighted vertex cover problem. Discrete Applied Mathematics, 156(3):292-312, 2008.
11. 2) steps. In Proc. 30th WG, pages 257-269, 2004.
12. Holger Dell and Dieter van Melkebeek. Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. In Proc. 42nd STOC, pages 251-260, 2010.
13. Josep Díaz, Jordi Petit, and Dimitrios M. Thilikos. Kernels for the vertex cover problem on the preferred attachment model. In Proc. 5th WEA, pages 231-240, 2006.
14. Michael Dom, Daniel Lokshtanov, and Saket Saurabh. Incompressibility through colors and IDs. In Proc. 36th ICALP, pages 378-389, 2009.
15. Rod Downey and Michael R. Fellows. Parameterized Complexity. Monographs In Computer Science. Springer, New York, 1999.
16. Rodney G. Downey, Michael R. Fellows, and Michael A. Langston, editors. The Computer Journal: Special Issue on Parameterized Complexity, Volume 51, 2008.
17. Rodney G. Downey, Michael R. Fellows, and Ulrike Stege. Parameterized complexity: A framework for systematically confronting computational intractability. In DIMACS Series In Discrete Mathematics and Theoretical Computer Science, pages 49-99, 1997.
18. Vladimir Estivill-Castro, Michael Fellows, Michael Langston, and Frances Rosamond. FPT is P-time extremal structure I. In Proc. 1st ACiD, pages 1-41, 2005.
19. Michael R. Fellows. Towards fully multivariate algorithmics: Some new results and directions in parameter ecology. In Proc. 20th IWOCA, pages 2-10, 2009.
20. Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Matthias Mnich, Frances A. Rosamond, and Saket Saurabh. The complexity ecology of parameters: An illustration using bounded max leaf number. Theory Comput. Syst., 45(4):822-848, 2009.
21. Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, and Saket Saurabh. Graph layout problems parameterized by vertex cover. In Proc. 19th ISAAC, pages 294-305, 2008.
22. Michael R. Garey and David S. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1979.
23. Jiong Guo and Rolf Niedermeier. Invitation to data reduction and problem kernelization. SIGACT News, 38(1):31-45, 2007.
24. Bart M. P. Jansen and Hans L. Bodlaender. Vertex cover kernelization revisited: Upper and lower bounds for a refined parameter. CoRR, abs/1012.4701, 2010.
25. Subhash Khot and Oded Regev. Vertex cover might be hard to approximate to within 2 - e. J. Comput. Syst. Sci., 74(3):335-349, 2008.
26. Stefan Kratsch and Pascal Schweitzer. Isomorphism for graphs of bounded feedback vertex set number. In Proc. 12th SWAT, pages 81-92, 2010.
27. GL. Nemhauser and L. Ejun. Trotter. Vertex packings: structural properties and algorithms. Math. Program., 8:232-248, 1975.
28. Rolf Niedermeier. Invitation to Fixed-Parameter Algorithms. Oxford University Press, 2006.
29. Rolf Niedermeier. Reflections on multivariate algorithmics and problem parameterization. In Proc. 27th STACS, pages 17-32, 2010.
30. Rolf Niedermeier and Peter Rossmanith. On efficient fixed-parameter algorithms for weighted vertex cover. J. Algorithms, 47(2):63-77, 2003.
31. Johannes Uhlmann and Mathias Weller. Two-layer planarization parameterized by feedback edge set. In Proc. 7th TAMC, pages 431-442, 2010.
32. Jennifer Zito. The structure and maximum number of maximum independent sets in trees. J. Graph Theory, 15(2):207-221, 1991.