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

From Algorithm Wiki
Revision as of 11:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Stege,_Fellows_%2B_Interleaving_method_(Niedermeier,_Rossmanith)_(The_Vertex_Cover_Problem_The_Vertex_Cover_Problem)&oldid=45686"