Niedermeier, Rossmanith (The Vertex Cover Problem The Vertex Cover Problem)
Jump to navigation
Jump to search
Time Complexity
$O(kn + {1.29175}^k k^{2})$.
Space Complexity
$O(k^{3})$ auxiliary? (potentially $O(k^{2})$??) words
((see remark in algo id #576))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1999
Reference
https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.69.1933&rep=rep1&type=pdf