Dunning; Gupta & Silberholz (Maximum Cut, Approximate Maximum Cut): Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(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")
 
No edit summary
 
Line 1: Line 1:
== Time Complexity ==  
== Time Complexity ==  


$O(VE)$
$O(mn)$


== Space Complexity ==  
== Space Complexity ==  

Latest revision as of 08:50, 10 April 2023

Time Complexity

$O(mn)$

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=47506"