Models of greedy algorithms for graph problems
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Local versus global properties of metric spaces
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Compacting cuts: a new linear formulation for minimum cut
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Linear programming relaxations of maxcut
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Approximability of the capacitated b-edge dominating set problem
Theoretical Computer Science
Discrete Applied Mathematics
Vertex cover might be hard to approximate to within 2-ε
Journal of Computer and System Sciences
Sherali-adams relaxations of the matching polytope
Proceedings of the forty-first annual ACM symposium on Theory of computing
Compacting cuts: A new linear formulation for minimum cut
ACM Transactions on Algorithms (TALG)
Priority algorithms for graph optimization problems
Theoretical Computer Science
On linear and semidefinite programming relaxations for hypergraph matching
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On the approximability of the vertex cover and related problems
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Improving integrality gaps via Chvátal-Gomory rounding
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
How well can primal-dual and local-ratio algorithms perform?
ACM Transactions on Algorithms (TALG)
Further reflections on a theory for basic algorithms
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
How well can primal-dual and local-ratio algorithms perform?
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Lower bounds for lovász-schrijver systems and beyond follow from multiparty communication complexity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Towards optimal integrality gaps for hypergraph vertex cover in the lovász-schrijver hierarchy
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
An edge-reduction algorithm for the vertex cover problem
Operations Research Letters
Note: On the polyhedral lift-and-project methods and the fractional stable set polytope
Discrete Optimization
An information complexity approach to extended formulations
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications
Journal of Global Optimization
| Hi-index | 0.00 |
Proving integrality gaps for linear relaxations of NP optimization problems is a difficult task and usually undertaken on a case-by-case basis. We initiate a more systematic approach. We prove an integrality gap of 2 - o(1) for three families of linear relaxations for vertex cover, and our methods seem relevant to other problems as well.