Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

STOC
2006
ACM

favoriteEmaildiscussreport

57views Algorithms» more STOC 2006»

Integrality gaps for sparsest cut and minimum linear arrangement problems

14 years 4 months ago

Integrality gaps for sparsest cut and minimum linear arrangement problems

Download www.cc.gatech.edu

Nikhil R. Devanur, Subhash Khot, Rishi Saket, Nish

Real-time Traffic

Algorithms | Minimum Linear Arrangement | STOC 2006 |

claim paper

Related Content

» Inapproximability Results for Maximum Edge Biclique Minimum Linear Arrangement and Sparses...

» Integrality gaps for SheraliAdams relaxations

» Lasserre Hierarchy Higher Eigenvalues and Approximation Schemes for Quadratic Integer Prog...

» Improved Approximation for the Directed Spanner Problem

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2006
Where	STOC
Authors	Nikhil R. Devanur, Subhash Khot, Rishi Saket, Nisheeth K. Vishnoi

Comments (0)