Go to the corresponding LIPIcs Volume Portal 
Braun, Gábor ; Fiorini, Samuel ; Pokutta, Sebastian
pdfformat: 

@InProceedings{braun_et_al:LIPIcs:2014:4720, author = {G{\'a}bor Braun and Samuel Fiorini and Sebastian Pokutta}, title = {{Average Case Polyhedral Complexity of the Maximum Stable Set Problem}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)}, pages = {515530}, 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/4720}, URN = {urn:nbn:de:0030drops47201}, doi = {10.4230/LIPIcs.APPROXRANDOM.2014.515}, annote = {Keywords: polyhedral approximation, extended formulation, stable sets} }
Keywords:  polyhedral approximation, extended formulation, stable sets  
Collection:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)  
Issue Date:  2014  
Date of publication:  04.09.2014 