Approximate Inference via Weighted Rademacher Complexity
A shortest augmenting path algorithm for dense and sparse linear assignment problems