Abstract
We investigate the parameterized complexity of Vertex Cover parameterized by the difference between the size of the optimal solution and the value of the linear programming (LP) relaxation of the problem. By carefully analyzing the change in the LP value in the branching steps, we argue that combining previously known preprocessing rules with the most straightforward branching algorithm yields an O*(2.618k) algorithm for the problem. Here, k is the excess of the vertex cover size over the LP optimum, and we write O*(f(k)) for a time complexity of the form O(f(k)nO(1)). We proceed to show that a more sophisticated branching algorithm achieves a running time of O*(2.3146k).
Following this, using previously known as well as new reductions, we give O*(2.3146k) algorithms for the parameterized versions of Above Guarantee Vertex Cover, Odd Cycle Transversal, Split Vertex Deletion, and Almost 2-SAT, and O*(1.5214k) algorithms for König Vertex Deletion and Vertex Cover parameterized by the size of the smallest odd cycle transversal and König vertex deletion set. These algorithms significantly improve the best known bounds for these problems. The most notable improvement among these is the new bound for Odd Cycle Transversal—this is the first algorithm that improves on the dependence on k of the seminal O*(3k) algorithm of Reed, Smith, and Vetta. Finally, using our algorithm, we obtain a kernel for the standard parameterization of Vertex Cover with at most 2k − clog k vertices. Our kernel is simpler than previously known kernels achieving the same size bound.
- Hans L. Bodlaender, Bart M. P. Jansen, and Stefan Kratsch. 2011. Preprocessing for treewidth: A combinatorial analysis through kernelization. In Proceedings of the 38th International Colloquium Conference on Automata, Languages, and Programming, Vol. Part I (ICALP'11). 437--448. Google ScholarDigital Library
- Leizhen Cai. 1996. Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters 58, 4, 171--176. Google ScholarDigital Library
- Jianer Chen, Iyad A. Kanj, and Ge Xia. 2010. Improved upper bounds for vertex cover. Theoretical Computer Science 411, 40--42, 3736--3756. Google ScholarDigital Library
- Miroslav Chlebík and Janka Chlebíková. 2008. Crown reductions for the Minimum Weighted Vertex Cover problem. Discrete Applied Mathematics 156, 3, 292--312. Google ScholarDigital Library
- Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, and Jakub Onufry Wojtaszczyk. 2013. On multiway cut parameterized above lower bounds. Transactions on Computation Theory 5, 1, Article No. 3. Google ScholarDigital Library
- Rod G. Downey and Michael R. Fellows. 1999. Parameterized Complexity. Springer-Verlag, New York, NY. Google ScholarDigital Library
- Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Matthias Mnich, Frances A. Rosamond, and Saket Saurabh. 2009. The complexity ecology of parameters: An illustration using bounded max leaf number. Theory of Computing Systems 45, 4, 822--848. Google ScholarDigital Library
- Jörg Flum and Martin Grohe. 2006. Parameterized Complexity Theory. Springer-Verlag, Berlin, Germany. Google ScholarDigital Library
- Georg Gottlob and Stefan Szeider. 2008. Fixed-parameter algorithms for artificial intelligence, constraint satisfaction and database problems. Computer Journal 51, 3, 303--325. Google ScholarDigital Library
- Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, and Sebastian Wernicke. 2006. Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. Journal of Computer and System Sciences 72, 8, 1386--1396. DOI:http://dx.doi.org/10.1016/j.jcss.2006.02.001 Google ScholarDigital Library
- Falk Hüffner. 2009. Algorithm engineering for optimal graph bipartization. Journal of Graph Algorithms and Applications 13, 2, 77--98.Google ScholarCross Ref
- Bart M. P. Jansen and Hans L. Bodlaender. 2013. Vertex cover kernelization revisited—upper and lower bounds for a refined parameter. Theory of Computing Systems 53, 2, 263--299.Google ScholarCross Ref
- Bart M. P. Jansen and Stefan Kratsch. 2011. On polynomial kernels for structural parameterizations of odd cycle transversal. In Proceedings of the 6th International Conference on Parameterized and Exact Computation (IPEC'11). 132--144. Google ScholarDigital Library
- Stefan Kratsch and Magnus Wahlström. 2012. Representative sets and irrelevant vertices: New tools for kernelization. In Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS'12). 450--459. Google ScholarDigital Library
- Michael Lampis. 2011. A kernel of order 2 k-c log k for vertex cover. Information Processing Letters 111, 23--24, 1089--1091. Google ScholarDigital Library
- Daniel Lokshtanov, Saket Saurabh, and Somnath Sikdar. 2009. Simpler parameterized algorithm for OCT. In Combinatorial Algorithms. 380--384.Google Scholar
- Meena Mahajan and Venkatesh Raman. 1999. Parameterizing above guaranteed values: MaxSat and MaxCut. Journal of Algorithms 31, 2, 335--354. Google ScholarDigital Library
- Dániel Marx and Igor Razgon. 2009. Constant ratio fixed-parameter approximation of the edge multicut problem. Information Processing Letters 109, 20, 1161--1166. Google ScholarDigital Library
- Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, and C. R. Subramanian. 2011. The complexity of könig subgraph problems and above-guarantee vertex cover. Algorithmica 61, 4, 857--881. Google ScholarDigital Library
- George L. Nemhauser and Leslie E. Trotter. 1974. Properties of vertex packing and independence system polyhedra. Mathematical Programming 6, 1, 48--61.Google ScholarDigital Library
- George L. Nemhauser and Leslie E. Trotter. 1975. Vertex packings: Structural properties and algorithms. Mathematical Programming 8, 1, 232--248.Google ScholarDigital Library
- Rolf Niedermeier. 2006. Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications, Vol. 31. Oxford University Press, Oxford, UK.Google ScholarCross Ref
- Jean-Claude Picard and Maurice Queyranne. 1977. On the integer-valued variables in the linear vertex packing problem. Mathematical Programming 12, 1, 97--101. DOI:http://dx.doi.org/10.1007/BF01593772Google ScholarDigital Library
- Venkatesh Raman, M. S. Ramanujan, and Saket Saurabh. 2011. Paths, flowers and vertex cover. In Proceedings of the 19th European Conference on Algorithms (ESA'11). 382--393. Google ScholarDigital Library
- Igor Razgon and Barry O'Sullivan. 2009. Almost 2-SAT is fixed-parameter tractable. Journal of Computer and System Sciences 75, 8, 435--450. Google ScholarDigital Library
- Bruce A. Reed, Kaleigh Smith, and Adrian Vetta. 2004. Finding odd cycle transversals. Operations Research Letters 32, 4, 299--301. Google ScholarDigital Library
Index Terms
- Faster Parameterized Algorithms Using Linear Programming
Recommendations
Faster Parameterized Algorithms for Minimum Fill-in
We present two parameterized algorithms for the Minimum Fill-in problem, also known as Chordal Completion: given an arbitrary graph G and integer k, can we add at most k edges to G to obtain a chordal graph? Our first algorithm has running time $\...
Improved Parameterized Algorithms for Mixed Domination
Algorithmic Aspects in Information and ManagementAbstractA mixed domination of a graph is a mixed set D of vertices and edges such that for every edge or vertex, if it is not in D, then it is adjacent or incident to at least one vertex or edge in D. The Mixed Domination problem is to check ...
Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized
Computer Science – Theory and ApplicationsAbstractLet be a family of graphs. In the classical -Vertex Deletion problem, given a graph G and a positive integer k, the objective is to check whether there exists a subset S of at most k vertices such that is in . In this paper, we introduce the ...
Comments