Yuval Rabani, Rakesh Venkat. Approximating Sparsest Cut in Low Rank Graphs via Embeddings from Approximately Low Dimensional Spaces. In Klaus Jansen, José D. P. Rolim, David Williamson, Santosh Srinivas Vempala, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA. Volume 81 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]
@inproceedings{RabaniV17,
title = {Approximating Sparsest Cut in Low Rank Graphs via Embeddings from Approximately Low Dimensional Spaces},
author = {Yuval Rabani and Rakesh Venkat},
year = {2017},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2017.21},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.21},
researchr = {https://researchr.org/publication/RabaniV17},
cites = {0},
citedby = {0},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA},
editor = {Klaus Jansen and José D. P. Rolim and David Williamson and Santosh Srinivas Vempala},
volume = {81},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-044-6},
}