L04-weighted

L04-weighted - We ighte BipartiteMatching d Le cture4: Jan...

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

1 Weighted Bipartite Matching Lecture 4: Jan 18

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

View Full Document
2 Weighted Bipartite Matching Given a weighted bipartite graph, find a matching with maximum total weight. Not necessarily a maximum size matching. A B
3 Today’s Plan Three algorithms negative cycle algorithm primal dual algorithm augmenting path algorithm Applications

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

View Full Document
4 First Algorithm How to know if a given matching M is optimal? Idea: Imagine there is a larger matching M* and consider the union of M and M* Find maximum weight perfect matching
5 First Algorithm Orient the edges (edges in M go up, others go down) edges in M having positive weights, otherwise negative weights Then M is maximum if and only if there is no negative cycles

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

View Full Document
6 First Algorithm Key: M is maximum no negative cycle How to find efficiently?
7 Complexity At most nW iterations A negative cycle in time by Floyd Warshall Total running time Can choose minimum mean cycle to avoid W

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

View Full Document
8 Augmenting Path Algorithm Orient the edges (edges in M go up, others go down)
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 / 21

L04-weighted - We ighte BipartiteMatching d Le cture4: Jan...

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

View Full Document
Ask a homework question - tutors are online