Advertisement

Generating and searching sets induced by networks

Preliminary version
  • Greg N. Frederickson
  • Donald B. Johnson
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 85)

Keywords

Cycle Tree Demand Point Minimum Cardinality Feasibility Test Supply Point 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BY]
    Bentley, J. L. and A. C. Yao, An almost optimal algorithm for unbounded searching, Inf. Proc. Letters 5 (1976) 82–87.Google Scholar
  2. [Bℓ]
    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.Google Scholar
  3. [CD]
    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.Google Scholar
  4. [CT1]
    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.Google Scholar
  5. [CT2]
    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.Google Scholar
  6. [FJ1]
    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.Google Scholar
  7. [FJ2]
    Frederickson, G. N. and D. B. Johnson, Generalized selection and ranking, Proceedings 12th Ann. ACM Symp. Theory Comput., April 1980, (to appear).Google Scholar
  8. [G1]
    Goldman, A. J., Optimal center location in simple networks, Transp. Sci. 5 (1971) 212–221.Google Scholar
  9. [G2]
    Goldman, A. J., Minimax location of a facility in an undirected tree graph, Transp. Sci. 6 (1972) 407–418.Google Scholar
  10. [H1]
    Hakimi, S. L., Optimum locations of switching centers and the absolute centers and medians of a graph, Opns. Res. 12 (1964) 450–459.Google Scholar
  11. [H2]
    Hakimi, S. L., Optimal distribution of switching centers in a communications network and some related graph theoretic problems, Opns. Res. 13 (1965) 462–475.Google Scholar
  12. [Hr1]
    Handler, G. Y., Minimax location of a facility in an undirected tree graph, Transp. Sci. 7 (1973) 287–293.Google Scholar
  13. [Hr2]
    Handler, G. Y., Finding two-centers of a tree: the continuous case, Transp. Sci. 12 (1978) 93–106.Google Scholar
  14. [KH]
    Kariv, O. and S. L. Hakimi, An algorithmic approach to network location problems, SIAM J. Appl. Math. 37 (Dec. 1979) 513–538.Google Scholar
  15. [MTZC]
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • Greg N. Frederickson
    • 1
  • Donald B. Johnson
    • 1
  1. 1.Computer Science DepartmentThe Pennsylvania State UniversityUniversity ParkUSA

Personalised recommendations