Finding kth paths and p-centers by generating and searching good data structures
- 1 March 1983
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 4 (1) , 61-80
- https://doi.org/10.1016/0196-6774(83)90035-4
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Polynomially bounded algorithms for locatingp-centers on a treeMathematical Programming, 1982
- The complexity of selection and ranking in X + Y and matrices with sorted columnsJournal of Computer and System Sciences, 1982
- A Shifting Algorithm for Min-Max Tree PartitioningJournal of the ACM, 1982
- Location on Tree Networks: P-Centre and n-Dispersion ProblemsMathematics of Operations Research, 1981
- An $O ( ( n\log p )^2 )$ Algorithm for the Continuous p-Center Problem on a TreeSIAM Journal on Algebraic Discrete Methods, 1980
- Time bounds for selectionJournal of Computer and System Sciences, 1973
- Minimax Location of a Facility in a NetworkTransportation Science, 1972
- Optimal Center Location in Simple NetworksTransportation Science, 1971
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic ProblemsOperations Research, 1965
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a GraphOperations Research, 1964