![Combinatorial optimization / NP-complete problems / Graph connectivity / Linear programming / Mathematical optimization / Vertex cover / Cut / Linear programming relaxation / Maximum cut / Theoretical computer science / Mathematics / Graph theory Combinatorial optimization / NP-complete problems / Graph connectivity / Linear programming / Mathematical optimization / Vertex cover / Cut / Linear programming relaxation / Maximum cut / Theoretical computer science / Mathematics / Graph theory](https://www.pdfsearch.io/img/096d5d29c808bc14f4622258cd8bbb71.jpg) Date: 2007-11-05 11:00:31Combinatorial optimization NP-complete problems Graph connectivity Linear programming Mathematical optimization Vertex cover Cut Linear programming relaxation Maximum cut Theoretical computer science Mathematics Graph theory | | The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into `1 Subhash A. Khot Nisheeth K. VishnoiAdd to Reading ListSource URL: www.cs.nyu.eduDownload Document from Source Website File Size: 454,17 KBShare Document on Facebook
|