Algorithms for two bottleneck optimization problems
Open Access
- 1 September 1988
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 9 (3) , 411-417
- https://doi.org/10.1016/0196-6774(88)90031-4
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphsCombinatorica, 1986
- The min-max spanning tree problem and some extensionsInformation Processing Letters, 1978
- Finding the medianJournal of Computer and System Sciences, 1976
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- Time bounds for selectionJournal of Computer and System Sciences, 1973
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Technical Note—An Improved Algorithm for the Bottleneck Assignment ProblemOperations Research, 1971
- A note on two problems in connexion with graphsNumerische Mathematik, 1959