Parameterized Complexity of Generalized Vertex Cover Problems

Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of approximability. However, their parameterized complexity has so far been completely open. We close this gap here by showing that, with the size of the desired vertex cover as parameter, Connected Vertex Cover and Capacitated Vertex Cover are both fixed-parameter tractable while Maximum Partial Vertex Cover is W[1]-hard. This answers two open questions from the literature. The results extend to several closely related problems. Interestingly, although the considered generalized Vertex Cover problems behave very similar in terms of constant-factor approximability, they display a wide range of different characteristics when investigating their parameterized complexities.

[1]  Fabrizio Grandoni,et al.  Refined memorization for vertex cover , 2005, Inf. Process. Lett..

[2]  Ojas Parekh,et al.  Improved Approximations for Tour and Tree Covers , 2000, Algorithmica.

[3]  Markus Bläser,et al.  Computing small partial coverings , 2003, Inf. Process. Lett..

[4]  Nader H. Bshouty,et al.  Massaging a Linear Programming Solution to Give a 2-Approximation for a Generalization of the Vertex Cover Problem , 1998, STACS.

[5]  Liming Cai,et al.  On the existence of subexponential parameterized algorithms , 2003, J. Comput. Syst. Sci..

[6]  Weijia Jia,et al.  Vertex Cover: Further Observations and Further Improvements , 2001, J. Algorithms.

[7]  Dimitrios M. Thilikos,et al.  Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover , 2001, Discret. Appl. Math..

[8]  Esther M. Arkin,et al.  Approximating the Tree and Tour Covers of a Graph , 1993, Inf. Process. Lett..

[9]  Michael R. Fellows,et al.  Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments , 2004, ALENEX/ANALC.

[10]  Rolf Niedermeier,et al.  Parameterized complexity: exponential speed-up for planar graph problems , 2004, J. Algorithms.

[11]  Rolf Niedermeier,et al.  Ubiquitous Parameterization - Invitation to Fixed-Parameter Algorithms , 2004, MFCS.

[12]  Jan Kratochvíl,et al.  Mathematical Foundations of Computer Science 2004 , 2004, Lecture Notes in Computer Science.

[13]  Rajiv Gandhi,et al.  An improved approximation algorithm for vertex cover with hard capacities , 2006, J. Comput. Syst. Sci..

[14]  Rolf Niedermeier,et al.  A general method to speed up fixed-parameter-tractable algorithms , 2000, Inf. Process. Lett..

[15]  Venkatesh Raman,et al.  Approximation Algorithms for Some Parameterized Counting Problems , 2002, ISAAC.

[16]  Rolf Niedermeier,et al.  On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER , 2000, ISAAC.

[17]  Michael R. Fellows,et al.  New Directions and New Challenges in Algorithm Design and Complexity, Parameterized , 2003, WADS.

[18]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[19]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[20]  Rolf Niedermeier,et al.  Faster exact algorithms for hard problems: A parameterized point of view , 2001, Discret. Math..

[21]  Fabrizio Grandoni,et al.  Refined Memorisation for Vertex Cover , 2004, IWPEC.

[22]  Rolf Niedermeier,et al.  Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs , 2002, Algorithmica.

[23]  Rolf Niedermeier,et al.  Upper Bounds for Vertex Cover Further Improved , 1999, STACS.

[24]  Joseph Naor,et al.  Covering problems with hard capacities , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[25]  Christian Sloper,et al.  Either/Or: Using Vertex Cover Structure in Designing FPT-Algorithms - The Case of k-Internal Spanning Tree , 2003, WADS.

[26]  S. E. Dreyfus,et al.  The steiner problem in graphs , 1971, Networks.

[27]  Samir Khuller,et al.  Capacitated vertex covering , 2003, J. Algorithms.

[28]  Ulrike Stege,et al.  Solving large FPT problems on coarse-grained parallel machines , 2003, J. Comput. Syst. Sci..

[29]  Rolf Niedermeier,et al.  Invitation to Fixed-Parameter Algorithms , 2006 .

[30]  Rajiv Gandhi,et al.  Approximation algorithms for partial covering problems , 2004, J. Algorithms.

[31]  Niklaus Wirth,et al.  Algorithms and Data Structures , 1989, Lecture Notes in Computer Science.

[32]  Michael R. Fellows,et al.  An Improved Fixed-Parameter Algorithm for Vertex Cover , 1998, Inf. Process. Lett..

[33]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[34]  Rolf Niedermeier,et al.  Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs , 2005, Discret. Appl. Math..

[35]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.