Cost scaling approach
Round costs to power of 2. Solve. Halve rounding. Solve. Repeat log(VC) times.
Advertisement
Complexity
Best: O(V^(2.5) · log(VC)) via Gabow-Tarjan. Practical: Hungarian often fastest for small instances.
Advertisement
Assignment problem = matching
Same problem, different framing. Kuhn's original Hungarian solved this.
Auction algorithm
Bertsekas' distributed auction: unmatched vertices bid on preferred neighbors. Converges to min cost.