Maximization Problems Parameterized Using Their Minimization Versions: The Case of Vertex Cover

The parameterized complexity of problems is often studied with respect to the size of their optimal solutions. However, for a maximization problem, the size of the optimal solution can be very large, rendering algorithms parameterized by it inefficient. Therefore, we suggest to study the parameterized complexity of maximization problems with respect to the size of the optimal solutions to their minimization versions. We examine this suggestion by considering the Maximal Minimal Vertex Cover (MMVC) problem, whose minimization version, Vertex Cover, is one of the most studied problems in the field of Parameterized Complexity. Our main contribution is a parameterized approximation algorithm for MMVC, including its weighted variant. We also give conditional lower bounds for the running times of algorithms for MMVC and its weighted variant.

[1]  Hans L. Bodlaender,et al.  Vertex Cover Kernelization Revisited , 2010, Theory of Computing Systems.

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

[3]  Ge Xia,et al.  Improved upper bounds for vertex cover , 2010, Theor. Comput. Sci..

[4]  Hadas Shachnai,et al.  FPT Algorithms for Weighted Graphs Can be (Almost) as Efficient as for Unweighted , 2014, ArXiv.

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

[6]  Mathieu Liedloff,et al.  Treewidth and Pathwidth parameterized by the vertex cover number , 2013, Discret. Appl. Math..

[7]  Weijia Jia,et al.  Improvement on vertex cover for low-degree graphs , 2000, Networks.

[8]  Henning Fernau,et al.  A novel parameterised approximation algorithm for minimum vertex cover , 2013, Theor. Comput. Sci..

[9]  Fedor V. Fomin,et al.  Branching and Treewidth Based Exact Algorithms , 2006, ISAAC.

[10]  Thomas Peiselt.  Informatik Lehrstuhl Theoretische Informatik I / Komplexitätstheorie Studienarbeit An Iterative Compression Algorithm for Vertex Cover , 2007 .

[11]  Michael R. Fellows,et al.  Parameterized complexity: A framework for systematically confronting computational intractability , 1997, Contemporary Trends in Discrete Mathematics.

[12]  Ragesh Jaiswal,et al.  An $O^*(1.0821^n)$-Time Algorithm for Computing Maximum Independent Set in Graphs with Bounded Degree 3 , 2013, ArXiv.

[13]  Judy Goldsmith,et al.  Nondeterminism Within P , 1993, SIAM J. Comput..

[14]  Igor Razgon.  Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3 , 2009, J. Discrete Algorithms.

[15]  Miroslav Chlebík,et al.  Crown reductions for the Minimum Weighted Vertex Cover problem , 2008, Discret. Appl. Math..

[16]  Michael R. Fellows,et al.  Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity , 2013, Eur. J. Comb..

[17]  Vangelis Th. Paschos,et al.  Sparsification and subexponential approximation , 2014, Acta Informatica.

[18]  Michael R. Fellows,et al.  Fundamentals of Parameterized Complexity , 2013 .

[19]  Ge Xia,et al.  Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems , 2003, Algorithmica.

[20]  Fedor V. Fomin,et al.  Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques , 2014, Algorithmica.

[21]  Yoshio Okamoto,et al.  On Problems as Hard as CNF-SAT , 2011, 2012 IEEE 27th Conference on Computational Complexity.

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

[23]  Michael R. Fellows,et al.  Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] , 1995, Theor. Comput. Sci..

[24]  Fedor V. Fomin,et al.  On Two Techniques of Combining Branching and Treewidth , 2009, Algorithmica.

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

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

[27]  Vangelis Th. Paschos,et al.  On the max min vertex cover problem , 2013, Discret. Appl. Math..

[28]  Vangelis Th. Paschos,et al.  Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms , 2011, Discret. Appl. Math..

[29]  Mingyu Xiao.  A Note on Vertex Cover in Graphs with Maximum Degree 3 , 2010, COCOON.