Auction-Based Algorithms for Weighted Matroid Intersection with Near-Linear Query ComplexityResearch Paper
Matroid intersection asks for a largest (or heaviest) set that is independent in two matroids at once. It contains bipartite matching, arborescences, rainbow spanning trees and many scheduling and assignment problems as special cases, and it is one of the few problems where combinatorial optimization has an exact polynomial-time theory beyond network flows…