Khuller; Raghavachari & Young, "Greedy Methods" (Maximum Cut, Approximate Maximum Cut)

From Algorithm Wiki

Revision as of 08: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(n^{2})$?

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

2007

Reference

https://doc.lagout.org/science/0_Computer%20Science/2_Algorithms/Handbook%20of%20Approximation%20Algorithms%20and%20Metaheuristics%20%5BGonzalez%202007-01-05%5D.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Khuller;_Raghavachari_%26_Young,_%22Greedy_Methods%22_(Maximum_Cut,_Approximate_Maximum_Cut)&oldid=47504"