pdfformat: 

@InProceedings{louis_et_al:LIPIcs:2014:4707, author = {Anand Louis and Yury Makarychev}, title = {{Approximation Algorithms for Hypergraph Small Set Expansion and Small Set Vertex Expansion}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)}, pages = {339355}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897743}, ISSN = {18688969}, year = {2014}, volume = {28}, editor = {Klaus Jansen and Jos{\'e} D. P. Rolim and Nikhil R. Devanur and Cristopher Moore}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2014/4707}, URN = {urn:nbn:de:0030drops47079}, doi = {10.4230/LIPIcs.APPROXRANDOM.2014.339}, annote = {Keywords: Approximation Algorithms, Graph Expansion, Hypergraph Expansion, Vertex Expansion} }
Keywords:  Approximation Algorithms, Graph Expansion, Hypergraph Expansion, Vertex Expansion  
Seminar:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)  
Issue date:  2014  
Date of publication:  2014 