On a Representation of the Matching Polytope Via Semidefinite Liftings

Authors:
Tamon Stephen;Levent Tuncel
Affiliations:
-;-
Venue:
Mathematics of Operations Research
Year:
1999

Citing 0
Cited 12

Exponential Lower Bound for Static Semi-algebraic Proofs

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Complexity of Semi-algebraic Proofs

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Lift and project relaxations for the matching and related polytopes

Discrete Applied Mathematics
On Extracting Maximum Stable Sets in Perfect Graphs Using Lovász's Theta Function

Computational Optimization and Applications
On the commutativity of antiblocker diagrams under lift-and-project operators

Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra

Discrete Applied Mathematics
Sherali-adams relaxations of the matching polytope

Proceedings of the forty-first annual ACM symposium on Theory of computing
Complexity analyses of Bienstock-Zuckerberg and lasserre relaxations on the matching and stable set polytopes

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Sherali-Adams relaxations and indistinguishability in counting logics

Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
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
Note: On the polyhedral lift-and-project methods and the fractional stable set polytope

Discrete Optimization
Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the relaxation of the matching polytope defined by the non-negativity and degree constraints. We prove that given an undirected graph on n nodes and the corresponding relaxation of the matching polytope, [n/2] iterations of the Lovasz-Schrijver semidefinite lifting procedure are needed to obtain the matching polytope, in the worst case. We show that [n/2] iterations of the procedure always suffice.