Average case polyhedral complexity of the maximum stable set problem
Preprint
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 2^{\Omega(n/ log n)} lower bound probability with at least 1-2^{-2^{n}} for every LP that is exact for a randomly selected set of instances; each graph on at most n vertices being selected independently with probability p >= 2^{- \binom{n/4}{2} + n}. 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 G(n, p) 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 p=Omega((log^(6+eps) n) / n) to p=O(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.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Common Information and Unique DisjointnessAlgorithmica, 2016
- A Short Proof that the Extension Complexity of the Correlation Polytope Grows ExponentiallyDiscrete & Computational Geometry, 2014
- The matching polytope does not admit fully-polynomial size relaxation schemes2014
- On the extension complexity of combinatorial polytopesMathematical Programming, 2014
- A note on the extension complexity of the knapsack polytopeOperations Research Letters, 2013
- Approximation Limits of Linear Programs (Beyond Hierarchies)2012
- Some 0/1 polytopes need exponential size extended formulationsMathematical Programming, 2012
- Extended formulations in combinatorial optimization4OR, 2010
- A linear‐size zero—one programming model for the minimum spanning tree problem in planar graphsNetworks, 2001
- Expressing combinatorial optimization problems by Linear ProgramsJournal of Computer and System Sciences, 1991