Stege, Fellows + Interleaving method (Niedermeier, Rossmanith) (The Vertex Cover Problem The Vertex Cover Problem)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(kn+({1.2906})$^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

2000

Reference

https://mediatum.ub.tum.de/doc/1094228/file.pdf