Integrality gaps for sparsest cut and minimum linear arrangement problems

Nikhil R. Devanur, Subhash Khot, Rishi Saket, Nisheeth K. Vishnoi. Integrality gaps for sparsest cut and minimum linear arrangement problems. In Jon M. Kleinberg, editor, Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006. pages 537-546, ACM, 2006. [doi]

Abstract

Abstract is missing.