Khuller; Raghavachari & Young, "Greedy Methods" (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 11:5311:53, 15 February 2023‎ Admin talk contribs‎ 494 bytes +494‎ Created page with "== Time Complexity == $O(V^{2})$? == Space Complexity == $O(V)$ auxiliary 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%..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Khuller;_Raghavachari_%26_Young,_%22Greedy_Methods%22_(Maximum_Cut,_Approximate_Maximum_Cut)"