Papadimitriou and M Yannakakis 1996 + Buss (The Vertex Cover Problem The Vertex Cover Problem)
Jump to navigation
Jump to search
Time Complexity
$O({3}^k k^{2}+kn)$
Space Complexity
$O(k^{2})$ auxiliary? words
(Auxiliary graph contains O(k^2) edges unless the instance is rejected; rest of steps take O(k) auxiliary space at most)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1996
Reference
https://www.sciencedirect.com/science/article/pii/S0022000096900586