Khuller; Raghavachari & Young, "Greedy Methods" (Maximum Cut, Approximate Maximum Cut): Difference between revisions
Jump to navigation
Jump to search
(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%...") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O( | $O(n^{2})$? | ||
== Space Complexity == | == Space Complexity == | ||
$O( | $O(n)$ words | ||
(Keeps track of current coloring/assignment) | (Keeps track of current coloring/assignment) | ||
Latest revision as of 09:50, 10 April 2023
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