Go to the corresponding LIPIcs Volume Portal 
Rabani, Yuval ; Venkat, Rakesh
pdfformat: 

@InProceedings{rabani_et_al:LIPIcs:2017:7570, author = {Yuval Rabani and Rakesh Venkat}, title = {{Approximating Sparsest Cut in Low Rank Graphs via Embeddings from Approximately Low Dimensional Spaces}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)}, pages = {21:121:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770446}, ISSN = {18688969}, year = {2017}, volume = {81}, editor = {Klaus Jansen and Jos{\'e} D. P. Rolim and David Williamson and Santosh S. Vempala}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7570}, URN = {urn:nbn:de:0030drops75705}, doi = {10.4230/LIPIcs.APPROXRANDOM.2017.21}, annote = {Keywords: Metric Embeddings, Sparsest Cut, Negative type metrics, Approximation Algorithms} }
Keywords:  Metric Embeddings, Sparsest Cut, Negative type metrics, Approximation Algorithms  
Seminar:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)  
Issue Date:  2017  
Date of publication:  31.07.2017 