Sciweavers

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

80

CORR
2012
Springer

203views Education» more CORR 2012»

Constant Factor Lasserre Integrality Gaps for Graph Partitioning Problems

13 years 10 months ago

Constant Factor Lasserre Integrality Gaps for Graph Partitioning Problems

Download www.cs.cmu.edu

Venkatesan Guruswami, Ali Kemal Sinop, Yuan Zhou

Real-time Traffic

CORR 2012 | Education |

claim paper

Related Content

» CSP gaps and reductions in the lasserre hierarchy

» Polynomial integrality gaps for strong SDP relaxations of Densest ksubgraph

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

» Constant factor approximation algorithm for the knapsack median problem

» On the Inapproximability of Vertex Cover on kPartite kUniform Hypergraphs

» Edgedisjoint paths in Planar graphs with constant congestion

» Quadratic forms on graphs

» Asymmetric Traveling Salesman Path and Directed Latency Problems

» EdgeDisjoint Paths in Planar Graphs

Post Info
More Details (n/a)

Added	20 Apr 2012
Updated	20 Apr 2012
Type	Journal
Year	2012
Where	CORR
Authors	Venkatesan Guruswami, Ali Kemal Sinop, Yuan Zhou

Comments (0)