Ausiello et al. (Maximum Cut, Approximate Maximum Cut)
Jump to navigation
Jump to search
Time Complexity
$O(n^{3} \log m)$
Space Complexity
$O(n^{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