Back to Results
First PageMeta Content
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


The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into `1 Subhash A. Khot Nisheeth K. Vishnoi
Add to Reading List

Document Date: 2007-11-05 11:00:31


Open Document

File Size: 454,17 KB

Share Result on Facebook

City

Rabinovich / Linial / New Delhi / London / /

Company

Vertex / SDP Solutions / /

Country

United States / India / /

/

Facility

Subhash A. Khot Nisheeth K. Vishnoi College of Computing / Georgia Institute of Technology / /

IndustryTerm

computer search / integral solutions / algorithmic applications / approximation algorithm / graph theoretic algorithms / factor algorithm / approximation algorithms / /

Organization

Georgia Institute of Technology / IBM India Research Lab / Organization of the Main Body / Subhash A. Khot Nisheeth K. Vishnoi College of Computing / /

Person

Rao / Leighton / /

Position

author / straight-forward / representative / /

ProvinceOrState

Georgia / /

Technology

Leighton-Rao algorithm / approximation algorithm / factor algorithm / designing graph theoretic algorithms / approximation algorithms / 1 Algorithms / /

SocialTag