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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Theoretical computer science Ročník 411; číslo 40-42; s. 3736 - 3756
Hlavní autori:	Chen, Jianer, Kanj, Iyad A., Xia, Ge
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Oxford Elsevier 06.09.2010
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!