Abstract
The groundbreaking work of Rothvos [2014] established that every linear program expressing the matching polytope has an exponential number of inequalities (formally the matching polytope has exponential extension complexity). We generalize this result by deriving strong bounds on the polyhedral inapproximability of the matching polytope: for fixed 0
Full Text
Paper version not known (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call