Geometric algorithms for the minimum cost assignment problem
- 1 July 1995
- journal article
- Published by Wiley in Random Structures & Algorithms
- Vol. 6 (4) , 393-406
- https://doi.org/10.1002/rsa.3240060403
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Efficient Algorithms for the Hitchcock Transportation ProblemSIAM Journal on Computing, 1995
- Improved Algorithms for Bipartite Network FlowSIAM Journal on Computing, 1994
- Splitting a configuration in a simplexAlgorithmica, 1993
- Faster Scaling Algorithms for Network ProblemsSIAM Journal on Computing, 1989
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- ɛ-nets and simplex range queriesDiscrete & Computational Geometry, 1987
- Triangulating point sets in spaceDiscrete & Computational Geometry, 1987
- Expected time bounds for selectionCommunications of the ACM, 1975
- Time bounds for selectionJournal of Computer and System Sciences, 1973
- On the Uniform Convergence of Relative Frequencies of Events to Their ProbabilitiesTheory of Probability and Its Applications, 1971