Gábor Braun, Samuel Fiorini, Sebastian Pokutta. Average Case Polyhedral Complexity of the Maximum Stable Set Problem. In Klaus Jansen, José D. P. Rolim, Nikhil R. Devanur, Cristopher Moore, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain. Volume 28 of LIPIcs, pages 515-530, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2014. [doi]
@inproceedings{BraunFP14,
title = {Average Case Polyhedral Complexity of the Maximum Stable Set Problem},
author = {Gábor Braun and Samuel Fiorini and Sebastian Pokutta},
year = {2014},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.515},
url = {http://dx.doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.515},
researchr = {https://researchr.org/publication/BraunFP14},
cites = {0},
citedby = {0},
pages = {515-530},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain},
editor = {Klaus Jansen and José D. P. Rolim and Nikhil R. Devanur and Cristopher Moore},
volume = {28},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-939897-74-3},
}