Chen; I. Kanj; and W. Jia. (The Vertex Cover Problem The Vertex Cover Problem)
Jump to navigation
Jump to search
Time Complexity
$O({1.2738}^k+ kn)$
Space Complexity
$O(poly(n))$ words
(https://www.cs.lafayette.edu/~gexia/research/mfcs06.pdf)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2006