Average case polyhedral complexity of the maximum stable set problem
- 25 March 2016
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 160 (1-2) , 407-431
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- NSF (CMMI-1300144)
This publication has 23 references indexed in Scilit:
- Approximation Limits of Linear Programs (Beyond Hierarchies)Mathematics of Operations Research, 2015
- Inapproximability of Combinatorial Problems via Small LPs and SDPs2015
- The matching polytope does not admit fully-polynomial size relaxation schemes2014
- On the extension complexity of combinatorial polytopesMathematical Programming, 2014
- Approximate Constraint Satisfaction Requires Large LP Relaxations2013
- Common Information and Unique Disjointness2013
- An information complexity approach to extended formulations2013
- Linear vs. semidefinite extended formulations2012
- Extended formulations in combinatorial optimization4OR, 2010
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965