Enumerate and expand: improved algorithms for connected vertex cover and tree cover

Authors:
Daniel Mölle;Stefan Richter;Peter Rossmanith
Affiliations:
Dept. of Computer Science, RWTH Aachen University, Germany;Dept. of Computer Science, RWTH Aachen University, Germany;Dept. of Computer Science, RWTH Aachen University, Germany
Venue:
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Year:
2006

Citing 9
Cited 7

An improved fixed-parameter algorithm for vertex cover

Information Processing Letters
Vertex cover: further observations and further improvements

Journal of Algorithms
On Parameterized Enumeration

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
On efficient fixed-parameter algorithms for weighted vertex cover

Journal of Algorithms
Refined memorization for vertex cover

Information Processing Letters
Upper bounds for vertex cover further improved

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
A faster algorithm for the steiner tree problem

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Parameterized complexity of generalized vertex cover problems

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Parameterized Complexity

Parameterized Complexity

Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs

Journal of Discrete Algorithms
Complexity and approximation results for the connected vertex cover problem

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Capacitated domination and covering: a parameterized perspective

IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Enumerate and expand: new runtime bounds for vertex cover variants

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Intuitive algorithms and t-vertex cover

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Deterministic parameterized connected vertex cover

SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Counting minimum weighted dominating sets

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new method of solving graph problems related to VERTEX COVER by enumerating and expanding appropriate sets of nodes. As an application, we obtain dramatically improved runtime bounds for two variants of the VERTEX COVER problem: In the case of CONNECTED VERTEX COVER, we take the upper bound from O*(6k) to O*(3.2361k) without large hidden factors. For TREE COVER, we show exactly the same complexity, improving vastly over the previous bound of O*((2k)k). In the process, faster algorithms for solving subclasses of the Steiner tree problem on graphs are investigated.