Improved Approximation Algorithms for Maximum Cut and Satis ability Problems Using Semide nite Programming
with an integrality gap of almost 2 | Coursera
Integer Programs and Network Models
SDP gaps and UGC-hardness for Max-Cut-Gain
Untitled
PDF) Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
Lovász-Schrijver Reformulation
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 12: Semidefinite Programming(SDP) Relaxation
On the Complexity of Unique Games and Graph Expansion
18.1 Graph Partitioning Problems
MINIMUM COST FLOWS: BASIC ALGORITHMS
Mixed-integer programming techniques for the connected max- k -cut problem | SpringerLink
Convex Relaxations and Integrality Gaps
Mixed-integer programming techniques for the connected max- k -cut problem | SpringerLink
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning - ScienceDirect
Mixed-integer programming techniques for the connected max- k -cut problem | SpringerLink
1 The Algorithm of Goemans and Williamson
