Dunning; Gupta & Silberholz (Maximum Cut, Approximate Maximum Cut)

From Algorithm Wiki

Revision as of 11:16, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(VE)$ == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2018 == Reference == https://pubsonline.informs.org/doi/epdf/10.1287/ijoc.2017.0798")

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

Jump to navigation Jump to search

Time Complexity

$O(VE)$

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2018

Reference

https://pubsonline.informs.org/doi/epdf/10.1287/ijoc.2017.0798

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Dunning;_Gupta_%26_Silberholz_(Maximum_Cut,_Approximate_Maximum_Cut)&oldid=45496"