A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs

A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs

The theta bodies of a polynomial ideal are a series of semidefinite programming relaxations of the convex hull of the real variety of the ideal. In this paper we construct the theta bodies of the vanishing ideal of cycles in a binary matroid. Applied to cuts in graphs, this yields a new hierarchy of...

Full description

Bibliographic Details
Main Authors: Gouveia, João (Author), Laurent, Monique (Author), Parrilo, Pablo A. (Contributor), Thomas, Rekha (Author)
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Laboratory for Information and Decision Systems (Contributor)
Format: Article
Language:English
Published: Springer, 2011-05-13T21:46:59Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items