Improved Parameterized Upper Bounds for Vertex Cover

This paper presents an O(1.2738k + kn)-time polynomial-space parameterized algorithm for Vertex Cover improving the previous O(1.286k + kn)-time polynomial-space upper bound by Chen, Kanj, and Jia. The algorithm also improves the O(1.2745kk4 + kn)-time exponential-space upper bound for the problem b...

Full description

Saved in:
Bibliographic Details
Published inLecture notes in computer science pp. 238 - 249
Main Authors Chen, Jianer, Kanj, Iyad A., Xia, Ge
Format Book Chapter Conference Proceeding
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2006
Springer
SeriesLecture Notes in Computer Science
Subjects
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Theoretical computing
Upper bound
Graph covering
Computer theory
Polynomial time
Online AccessGet full text

Cover

More Information
Summary:This paper presents an O(1.2738k + kn)-time polynomial-space parameterized algorithm for Vertex Cover improving the previous O(1.286k + kn)-time polynomial-space upper bound by Chen, Kanj, and Jia. The algorithm also improves the O(1.2745kk4 + kn)-time exponential-space upper bound for the problem by Chandran and Grandoni.
ISBN:3540377913
9783540377917
ISSN:0302-9743
1611-3349
DOI:10.1007/11821069_21