Maximum Cut: Revision history

10 April 2023

• curprev 09:2409:24, 10 April 2023‎ Admin talk contribs‎ 1,989 bytes −24‎ No edit summary

15 February 2023

• curprev 14:0514:05, 15 February 2023‎ Admin talk contribs‎ 2,013 bytes +1,352‎ No edit summary
• curprev 13:0313:03, 15 February 2023‎ Admin talk contribs‎ 661 bytes −10‎ No edit summary

• curprev 11:2511:25, 15 February 2023‎ Admin talk contribs‎ 671 bytes +671‎ Created page with "{{DISPLAYTITLE:Maximum Cut (Maximum Cut)}} == Description == Given a graph $G=(V, E)$ with edge weights $c_e > 0$ for all $e\in E$, find a cut $\delta(W)$ such that $c(\delta(W)):=\Sigma_{e\in \dela(W)} c_e$ is as large as possible. == Parameters == <pre>n: number of vertices m: number of edges</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !!..."