License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2014.515
URN: urn:nbn:de:0030-drops-47201
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2014/4720/
Go to the corresponding LIPIcs Volume Portal

Braun, Gábor ; Fiorini, Samuel ; Pokutta, Sebastian

Average Case Polyhedral Complexity of the Maximum Stable Set Problem

pdf-format:
37.pdf (0.5 MB)

Abstract

We study the minimum number of constraints needed to formulate random instances of the maximum stable set problem via LPs (more precisely, linear extended formulations), in two distinct models. In the uniform model, the constraints of the LP are not allowed to depend on the input graph, which should be encoded solely in the objective function. There we prove a super-polynomial lower bound with overwhelming probability for every LP that is exact for a randomly selected set of instances with a natural distribution. In the non-uniform model, the constraints of the LP may depend on the input graph, but we allow weights on the vertices. The input graph is sampled according to the Erdös-Renyi model. There we obtain upper and lower bounds holding with high probability for various ranges of p. We obtain a super-polynomial lower bound all the way from essentially p = polylog(n) / n to p = 1 / log n. Our upper bound is close as there is only an essentially quadratic gap in the exponent, which also exists in the worst case model. Finally, we state a conjecture to close the gap both in the average-case and worst-case models.

BibTeX - Entry

@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 =	{515--530},
  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/4720},
  URN =		{urn:nbn:de:0030-drops-47201},
  doi =		{10.4230/LIPIcs.APPROX-RANDOM.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

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI