Chandran and F. Grandoni (The Vertex Cover Problem The Vertex Cover Problem)

From Algorithm Wiki
Revision as of 11:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(min({1.2759}^k k^{1.5}, {1.2745}^k k^{4}) + kn)$ == Space Complexity == $O(min({1.2759}^k k^{1.5}, {1.2745}^k k^{4}) + kn)$ but exponential words (https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.136.4409&rep=rep1&type=pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2004 == Reference == https://citeseerx.ist.psu.edu/viewdoc/downloa...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(min({1.2759}^k k^{1.5}, {1.2745}^k k^{4}) + kn)$

Space Complexity

$O(min({1.2759}^k k^{1.5}, {1.2745}^k k^{4}) + kn)$ but exponential words

(https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.136.4409&rep=rep1&type=pdf)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2004

Reference

https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.136.4409&rep=rep1&type=pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Chandran_and_F._Grandoni_(The_Vertex_Cover_Problem_The_Vertex_Cover_Problem)&oldid=44875"