pdf-format: |
|
@InProceedings{deshpande_et_al:LIPIcs:2014:4691, author = {Amit Deshpande and Rakesh Venkat}, title = {{Guruswami-Sinop Rounding without Higher Level Lasserre}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)}, pages = {105--114}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-74-3}, ISSN = {1868-8969}, year = {2014}, volume = {28}, editor = {Klaus Jansen and Jos{\'e} D. P. Rolim and Nikhil R. Devanur and Cristopher Moore}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2014/4691}, URN = {urn:nbn:de:0030-drops-46911}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.105}, annote = {Keywords: Sparsest Cut, Lasserre Hierarchy, Metric embeddings} }
Keywords: | Sparsest Cut, Lasserre Hierarchy, Metric embeddings | |
Seminar: | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014) | |
Issue date: | 2014 | |
Date of publication: | 04.09.2014 |