Stege, Fellows (The Vertex Cover Problem The Vertex Cover Problem)
Jump to navigation
Jump to search
Time Complexity
$O(kn+max(({1.25542})$^k k^{2}, ({1.2906})^k k)
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://www.research-collection.ethz.ch/bitstream/handle/20.500.11850/69332/eth-4359-01.pdf