Christofides ( Chromatic Number)
Revision as of 11: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.ezproxy.canberra.edu.au/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.ezproxy.canberra.edu.au/comjnl/article/14/1/38/356253?login=true")
Time Complexity
$O(n!*poly(n)$)
Space Complexity
$O(poly(n)$) words
(https://link-springer-com.ezproxy.canberra.edu.au/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.ezproxy.canberra.edu.au/comjnl/article/14/1/38/356253?login=true