New Results on the Complexity of p-Centre Problems
- 1 November 1983
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 12 (4) , 751-758
- https://doi.org/10.1137/0212051
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Finding kth paths and p-centers by generating and searching good data structuresJournal of Algorithms, 1983
- An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location ProblemsSIAM Journal on Computing, 1981
- 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
- Generating and searching sets induced by networksLecture Notes in Computer Science, 1980
- An Algorithmic Approach to Network Location Problems. I: Thep-CentersSIAM Journal on Applied Mathematics, 1979
- Combinatorial Optimization with Rational Objective FunctionsMathematics of Operations Research, 1979
- Finding Two-Centers of a Tree: The Continuous CaseTransportation Science, 1978
- Minimax Location of a Facility in an Undirected Tree GraphTransportation Science, 1973
- Optimal Center Location in Simple NetworksTransportation Science, 1971