An $O ( ( n\log p )^2 )$ Algorithm for the Continuous p-Center Problem on a Tree
- 1 December 1980
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 1 (4) , 370-375
- https://doi.org/10.1137/0601043
Abstract
No abstract availableAll Related Versions
This publication has 10 references indexed in Scilit:
- An Algorithmic Approach to Network Location Problems. I: Thep-CentersSIAM Journal on Applied Mathematics, 1979
- A Fast Selection Algorithm and the Problem of Optimum Distribution of EffortJournal of the ACM, 1979
- Finding Two-Centers of a Tree: The Continuous CaseTransportation Science, 1978
- Selecting the Kth Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $SIAM Journal on Computing, 1978
- On p-Centers in NetworksTransportation Science, 1978
- A Min-Max Theorem for p-Center Problems on a TreeTransportation Science, 1977
- A Minimax Location Problem on a NetworkTransportation Science, 1974
- Minimax Location of a Facility in an Undirected Tree GraphTransportation Science, 1973
- Time bounds for selectionJournal of Computer and System Sciences, 1973
- Minimax Location of a Facility in a NetworkTransportation Science, 1972