Polynomially bounded algorithms for locatingp-centers on a tree
- 1 December 1982
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 22 (1) , 304-315
- https://doi.org/10.1007/bf01581045
Abstract
No abstract availableKeywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Finding Two-Centers of a Tree: The Continuous CaseTransportation Science, 1978
- On p-Centers in NetworksTransportation Science, 1978
- A Minimax Location Problem on a NetworkTransportation Science, 1974
- A characterisation of rigid circuit graphsDiscrete Mathematics, 1974
- Time bounds for selectionJournal of Computer and System Sciences, 1973
- Minimax Location of a Facility in a NetworkTransportation Science, 1972
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal GraphSIAM Journal on Computing, 1972
- Blocking and anti-blocking pairs of polyhedraMathematical Programming, 1971
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a GraphOperations Research, 1964
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961