Learn More

The assignment problem concerns finding the minimum-cost perfect matching in a complete weighted n × n bi-partite graph. Any algorithm for this classical question clearly requires Ω(n 2) time, and the best known one (Edmonds and Karp, 1972) finds solution in O(n 3). For decades, it has remained unknown whether optimal computation time is closer to n 3 or n… (More)

- ‹
- 1
- ›