Generating and searching sets induced by networks
- 1 January 1980
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 221-233
- https://doi.org/10.1007/3-540-10003-2_73
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Generalized selection and ranking (Preliminary Version)Published by Association for Computing Machinery (ACM) ,1980
- An Algorithmic Approach to Network Location Problems. I: Thep-CentersSIAM Journal on Applied Mathematics, 1979
- Finding Two-Centers of a Tree: The Continuous CaseTransportation Science, 1978
- An almost optimal algorithm for unbounded searchingInformation Processing Letters, 1976
- 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
- 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