# L11-tree - Spanning Tree Polytope x1 x3 x2 Lecture 11 Feb...

This preview shows pages 1–8. Sign up to view the full content.

1 Spanning Tree Polytope Spanning Tree Polytope x1 x2 x3 Lecture 11: Feb 21

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

View Full Document
2 Big Picture LP-solver Problem LP-formulation Vertex solution Solution Polynomial time integral
3 Basic Solution Tight inequalities: inequalities achieved as equalities Basic solution: unique solution of n linearly independent tight inequalities

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

View Full Document
4 Bipartite Perfect Matching Goal: show that any basic solution is an integral solution. Bipartite perfect matching, 2n vertices. Minimal counterexample.
5 Maximum Bipartite Matchings An edge of 0, delete it. An edge of 1, reduce it. So, each vertex has degree 2, and there are at least 2n edges.

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

View Full Document
6 Maximum Bipartite Matchings An edge of 0, delete it. An edge of 1, reduce it. So, each vertex has degree 2, and there are at least 2n edges. How many tight inequalities? Exactly 2n How many linearly independent tight inequalities? At most 2n-1
Linear Dependency x1 x3 x4 x2 Multiply +1 Multiply -1 Each edge is counted twice, one positive, one negative. Sum up to 0 => linear dependency.

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

View Full Document
This is the end of the preview. Sign up to access the rest of the 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 / 22

L11-tree - Spanning Tree Polytope x1 x3 x2 Lecture 11 Feb...

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

View Full Document
Ask a homework question - tutors are online