This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bentley, J. L. and A. C. Yao, An almost optimal algorithm for unbounded searching, Inf. Proc. Letters 5 (1976) 82–87.
Blum, M., R. W. Floyd, V. R. Pratt, R. L. Rivest, and R. E. Tarjan, Time bounds for selection, J. Comput. Sys. Sci. 7 (1972) 448–461.
Chandrasekaran, R. and A. Daughtey, Problems of location on trees, Disc. Paper 357, Ctr. for Math. Studies in Econ. and Mgmt. Sci., Northwestern U., 1978.
Chandreskaran, R. and A. Tamir, Polynomially bounded algorithms for locating P-centers on a tree, Disc. Paper 358, Ctr. for Math. Studies in Econ. and Mgmt. Sci., Northwestern U., 1978.
Chandrasekaran, R. and A. Tamir, An 0((nlogP)2) algorithm for the continuous P-center problem on a tree, Disc. Paper 367, Ctr. for Math. Studies in Econ. and Mgmt. Sci., Northwestern U., 1978.
Frederickson, G. N. and D. B. Johnson, Optimal algorithms for generating quantile information in X+Y and matrices with sorted columns, Proc. 13th Ann. Conf. on Inf. Sci. and Sys., The Johns Hopkins U. (1979) 47–52.
Frederickson, G. N. and D. B. Johnson, Generalized selection and ranking, Proceedings 12th Ann. ACM Symp. Theory Comput., April 1980, (to appear).
Goldman, A. J., Optimal center location in simple networks, Transp. Sci. 5 (1971) 212–221.
Goldman, A. J., Minimax location of a facility in an undirected tree graph, Transp. Sci. 6 (1972) 407–418.
Hakimi, S. L., Optimum locations of switching centers and the absolute centers and medians of a graph, Opns. Res. 12 (1964) 450–459.
Hakimi, S. L., Optimal distribution of switching centers in a communications network and some related graph theoretic problems, Opns. Res. 13 (1965) 462–475.
Handler, G. Y., Minimax location of a facility in an undirected tree graph, Transp. Sci. 7 (1973) 287–293.
Handler, G. Y., Finding two-centers of a tree: the continuous case, Transp. Sci. 12 (1978) 93–106.
Kariv, O. and S. L. Hakimi, An algorithmic approach to network location problems, SIAM J. Appl. Math. 37 (Dec. 1979) 513–538.
Megiddo, N., A. Tamir, E. Zemel, and R. Chandrasekaran, An O(nlog2n) algorithm for the kth longest path in a tree with applications to location problems, Disc. Paper 379, Ctr. for Math. Studies in Econ. and Mgmt. Sci., Northwestern U., 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Frederickson, G.N., Johnson, D.B. (1980). Generating and searching sets induced by networks. In: de Bakker, J., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 1980. Lecture Notes in Computer Science, vol 85. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10003-2_73
Download citation
DOI: https://doi.org/10.1007/3-540-10003-2_73
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10003-4
Online ISBN: 978-3-540-39346-7
eBook Packages: Springer Book Archive