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 in:	Theoretical computer science Vol. 411; no. 40-42; pp. 3736 - 3756
Main Authors:	Chen, Jianer, Kanj, Iyad A., Xia, Ge
Format:	Journal Article
Language:	English
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
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!