Abstract
This paper presents an O(1.2738k + kn)-time polynomial-space parameterized algorithm for VERTEX COVER improving the previous O(1.286 k + 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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Chen, J., Kanj, I. A., & Xia, G. (2006). Improved parameterized upper bounds for vertex cover. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4162 LNCS, pp. 238–249). Springer Verlag. https://doi.org/10.1007/11821069_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
