Expander Flows, Geometric Embeddings and Graph Partitioning

DMCA

Expander Flows, Geometric Embeddings and Graph Partitioning (2004)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Sanjeev Arora , Satish Rao , Umesh Vazirani

Venue:	IN 36TH ANNUAL SYMPOSIUM ON THE THEORY OF COMPUTING
Citations:	312 - 18 self

BibTeX

@INPROCEEDINGS{Arora04expanderflows,,
    author = {Sanjeev Arora and Satish Rao and Umesh Vazirani},
    title = {Expander Flows, Geometric Embeddings and Graph Partitioning},
    booktitle = {IN 36TH ANNUAL SYMPOSIUM ON THE THEORY OF COMPUTING},
    year = {2004},
    pages = {222--231},
    publisher = {}
}

OpenURL

Abstract

We give a O( log n)-approximation algorithm for sparsest cut, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leighton and Rao (1988). We use a well-known semidefinite relaxation with triangle inequality constraints. Central to our analysis is a geometric theorem about projections of point sets in , whose proof makes essential use of a phenomenon called measure concentration.

Keyphrases

graph partitioning expander flow geometric embeddings measure concentration triangle inequality constraint sparsest cut well-known semidefinite relaxation essential use approximation algorithm point set graph conductance problem geometric theorem

DMCA