Papadimitriou and M Yannakakis (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({3}^k n)$ == Space Complexity == $O(k)$ auxiliary? words (keep track of maximal matching, and subsequent vertices in cover; note that max size is O(k) else we can reject immediately) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1996 == Reference == https://www.sciencedirect.com/science/article/pii/S0022000096900586")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O({3}^k n)$

Space Complexity

$O(k)$ auxiliary? words

(keep track of maximal matching, and subsequent vertices in cover; note that max size is O(k) else we can reject immediately)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1996

Reference

https://www.sciencedirect.com/science/article/pii/S0022000096900586

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