Papadimitriou and M Yannakakis (The Vertex Cover Problem The Vertex Cover Problem)
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