Ausiello et al. (Maximum Cut, Approximate Maximum Cut): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

10 April 2023

15 February 2023

  • curprev 10:5310:53, 15 February 2023‎ Admin talk contribs‎ 514 bytes +514‎ 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..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Ausiello_et_al._(Maximum_Cut,_Approximate_Maximum_Cut)"