Ausiello et al. (Maximum Cut, Approximate Maximum Cut)
Revision as of 11:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(V^{3} logE)$ == Space Complexity == $O(V^{2})$? words (Each vertex keeps track of O(V)-sized vector. assuming this is the goemans-williamson algorithm) == Description == == Approximate? == Approximate Approximation Factor: ~0.878; assuming this is the goemans-williamson algorithm == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2003 == Reference == https://link.springer.com/content/pdf/1...")
Time Complexity
$O(V^{3} logE)$
Space Complexity
$O(V^{2})$? words
(Each vertex keeps track of O(V)-sized vector. assuming this is the goemans-williamson algorithm)
Description
Approximate?
Approximate
Approximation Factor: ~0.878; assuming this is the goemans-williamson algorithm
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2003
Reference
https://link.springer.com/content/pdf/10.1007/978-3-642-58412-1.pdf?pdf=button