Go to the corresponding LIPIcs Volume Portal 
Manurangsi, Pasin ; Trevisan, Luca
pdfformat: 

@InProceedings{manurangsi_et_al:LIPIcs:2018:9424, author = {Pasin Manurangsi and Luca Trevisan}, title = {{Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)}, pages = {20:120:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770859}, ISSN = {18688969}, year = {2018}, volume = {116}, editor = {Eric Blais and Klaus Jansen and Jos{\'e} D. P. Rolim and David Steurer}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9424}, URN = {urn:nbn:de:0030drops94241}, doi = {10.4230/LIPIcs.APPROXRANDOM.2018.20}, annote = {Keywords: Approximation algorithms, Exponentialtime algorithms, Vertex Cover, Sparsest Cut, Balanced Separator} }
Keywords:  Approximation algorithms, Exponentialtime algorithms, Vertex Cover, Sparsest Cut, Balanced Separator  
Collection:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)  
Issue Date:  2018  
Date of publication:  13.08.2018 