L12-matching - 1 Matching Polytope Matching Polytope x1 x2...

Info iconThis preview shows pages 1–12. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 1 Matching Polytope Matching Polytope x1 x2 x3 Lecture 12: Feb 22 x1 x2 x3 2 Per fect Matching But not every solution is a matching!! 3 x1 x3 x2 x1 x2 x3 Matching Polytope x1 x2 x3 4 Valid I nequalities Enough? Inequalities which are satisfied by integer solutions but kill all unwanted fractional vertex solution. everywhere everywhere 5 Valid I nequalities Enough? Odd set inequalities Yes, thats enough. [Edmonds 1965] 6 Exponentially Many I nequalities Can take care by the ellipsoid method. Just need a separation oracle , which determines whether a solution is feasible. If not, find a violating inequality . How to construct a separation oracle for matching? 7 Rewr iting the Odd-Set Constr aints 8 Matching Polytope 9 Convex Combination A point y in R n is a convex combination of if there exist so that and 10 Ver tex Solution Fact: A solution is a vertex solution if and only if x is not a convex combination of other feasible solutions. A point y in R n is a convex combination of if y is in the convex hull of 11 Convex Combination Goal: Prove that every fractional solution can be...
View Full Document

This note was uploaded on 10/13/2009 for the course CS 5150 taught by Professor Xulei during the Spring '09 term at University of Central Arkansas.

Page1 / 27

L12-matching - 1 Matching Polytope Matching Polytope x1 x2...

This preview shows document pages 1 - 12. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online