Christofides ( Chromatic Number)

From Algorithm Wiki
Revision as of 10:54, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n!*poly(n)$) == Space Complexity == $O(poly(n)$) words (https://link.springer.com/article/10.1007/s00453-007-9149-8) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1971 == Reference == https://academic.oup.com/comjnl/article/14/1/38/356253?login=true")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n!*poly(n)$)

Space Complexity

$O(poly(n)$) words

(https://link.springer.com/article/10.1007/s00453-007-9149-8)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1971

Reference

https://academic.oup.com/comjnl/article/14/1/38/356253?login=true

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Christofides_(_Chromatic_Number)&oldid=45042"