250 likes | 425 Views
A Scaling Algorithm for Maximum Weight Matching in Bipartite Graphs. Ran Duan and Hsin-Hao Su Speaker: Hsin-Hao Su. Introduction. Task assignment, marriage matching, etc. Max: . 19$. Introduction. Maximum Weight Matching (MWM). 1000. i. u. 1732. 1000. j. v. 1732. 1000. k.
E N D
A Scaling Algorithm for Maximum Weight Matching in Bipartite Graphs Ran Duan and Hsin-Hao Su Speaker: Hsin-Hao Su
Introduction • Task assignment, marriage matching, etc. Max: 19$
Introduction Maximum Weight Matching (MWM) 1000 i u 1732 1000 j v 1732 1000 k x Total weight: 3464
Introduction Maximum Weight Perfect Matching (MWPM) • Every vertex must be matched 1000 i u 1732 1000 j v 1732 1000 k x Total weight: 3000
Reduction Between MWM and MWPM n: # vertices m: # edges W: the largest edge weight • If MWPM in time • MWM in time • If MWM in time • MWPM in time + 1000 + 1732 1000 + 1000 1732 + 1732 1000 + 1000 1732 1000
Problem History • [Kuhn 1955] Hungarian Algorithm • Based on the results of König and Egreváry • Recent discovery of Jacobi’s work in 19th century
Results for MWM n: # vertices m: # edges W: the largest edge weight 2012 This result
Duality and Optimality • Linear Programming Theory • Dual y(u) for every vertex u • M is optimal if and only if 1000 1732 1000 1732 1000
The Hungarian Algorithm 1000 1414 1000 1414 1000
The Hungarian Algorithm 1000 1414 1000 1414 1000
The Hungarian Algorithm 1000 1414 1000 1414 1000
Gabow and Tarjan’s Scaling Algorithm • -tightness • error
Gabow and Tarjan’s Scaling Algorithm For to do • -tight to -tight End For scales Modified Hungarian algorithm error < 1 optimal!
Faster Hungarian Search • Idea: do it simultaneously • iterations • time per iter. 1000 1414 1000 1414 1000
Our Approach • Each scale takes time • Gabow & Tarjan: scales Scale: scales Time:
First Half iterations • Choose • iterations suffice to decrease y(u) to zero • -tightness in 1000 1414 1000 1414 1000
Second Half • Balinsky & Gomory: Primal method • Tighten matched edges
Dilworth’s Lemma • Given a partially ordered set with n elements, there exists a chain or an anti-chain of size at least
Anti-Chain • Fix it in linear time
Chain • Fix it in linear time
Not a partially ordered set • an augmenting cycle to increase the weight of the matching increase by at least 1
Win-Win Analysis • Either • Dilworth’s Lemma is applicable • matched edges will be tighten • There exists an augmenting cycle • increases by at least 1 • Each happens at most times • Time: matched edges
Conclusion • An time algorithm for MWM • An time algorithm for MWPM • Reduction: if MWM in time, then MWPM in time • Open problem: • An time algorithm for MWPM?