An algorithm to solve the m × n assignment problem in expected time O(mn log n)
- 1 June 1980
- Vol. 10 (2), 143-152
- https://doi.org/10.1002/net.3230100205
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Efficient Algorithms for Shortest Paths in Sparse NetworksJournal of the ACM, 1977
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- On some techniques useful for solution of transportation network problemsNetworks, 1971
- Flows in NetworksPublished by Walter de Gruyter GmbH ,1963
- On the Shortest Route Through a NetworkManagement Science, 1960
- A note on two problems in connexion with graphsNumerische Mathematik, 1959