Chen; I. Kanj; and W. Jia. (The Vertex Cover Problem The Vertex Cover Problem)

From Algorithm Wiki

Revision as of 09:46, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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

Reference

https://www.cs.lafayette.edu/~gexia/research/mfcs06.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Chen;_I._Kanj;_and_W._Jia._(The_Vertex_Cover_Problem_The_Vertex_Cover_Problem)&oldid=47455"