Improved upper bounds for vertex cover

This paper presents an O ( 1.273 8 k + k n ) -time polynomial-space algorithm for Vertex Cover improving the previous O ( 1.28 6 k + k n ) -time polynomial-space upper bound by Chen, Kanj, and Jia. Most of the previous algorithms rely on exhaustive case-by-case branching rules, and an underlying con...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 411; no. 40-42; pp. 3736 - 3756
Main Authors JIANER CHEN, KANJ, Iyad A, GE XIA
Format Journal Article
LanguageEnglish
Published Oxford Elsevier 06.09.2010
Subjects
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
C (programming language)
Computer science; control theory; systems
Exact sciences and technology
Folding
Miscellaneous
Theoretical computing
Upper bounds
Variability
Branching
Vertex
Upper bound
Computer theory
Branch-and-search
Vertex cover
NP complete problem
Space time
Parameterized algorithm
NP-complete problem
Uniformity
Polynomial time
Online AccessGet full text

Cover

More Information
Summary:This paper presents an O ( 1.273 8 k + k n ) -time polynomial-space algorithm for Vertex Cover improving the previous O ( 1.28 6 k + k n ) -time polynomial-space upper bound by Chen, Kanj, and Jia. Most of the previous algorithms rely on exhaustive case-by-case branching rules, and an underlying conservative worst-case-scenario assumption. The contribution of the paper lies in the simplicity, uniformity, and obliviousness of the algorithm presented. Several new techniques, as well as generalizations of previous techniques, are introduced including: general folding, struction, tuples, and local amortized analysis. The algorithm also improves the O ( 1.274 5 k k 4 + k n ) -time exponential-space upper bound for the problem by Chandran and Grandoni.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2010.06.026