Mitzenmacher & Upfal (Maximum Cut, Approximate Maximum Cut)

From Algorithm Wiki

Revision as of 09:50, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(mn)$?

Space Complexity

$O(n)$ words

(Keeps track of current coloring/assignment)

Description

Approximate?

Approximate

Approximation Factor: 0.5

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2005

Reference

http://lib.ysu.am/open_books/413311.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Mitzenmacher_%26_Upfal_(Maximum_Cut,_Approximate_Maximum_Cut)&oldid=47503"