THE OPTIMAL LOCATION OF A STRUCTURED FACILITY IN A TREE NETWORK

References

• K. Abrahamson , N. Dadoun , D. G. Kirkpatrick and T. Przytycka A simple parallel tree contraction algorithm . Journal of Algorithms 10 ( 1989 ), 287 – 302 .
   Google Scholar
• R. Cole and U. Vishkin , The Accelerated Centroid Decomposition Technique for Optimal Parallel Tree Evaluation in Logarithmic Time . Ultracomputer Note 108, TR-242 , Dept. of Computer Science, Courant , Institute , NYU , 1986 .
   Google Scholar
• R. Cole and U. Vishkin , Approximate parallel scheduling. Part I The basic technique with applications to optimal parallel list ranking in logarithmic time . SIAM Journal on Computing 17 ( 1988 ), 128 – 142 .
   Web of Science ®Google Scholar
• D. Dolev , E. Upfal and M. Warmuth , Scheduling trees in parallel . International Workshop on Parallel Computing VLSI Algorithms and Architectures , 1984 .
   Google Scholar
• A. J. Goldman , Optimum center location in simple networks . Transportation Science 5 ( 1971 ), 212 – 221 .
   Google Scholar
• S. L. Hakimi , Optimal distribution of switching centers in communication networks and some related graph theoretical problems . Operations Research 13 ( 1965 ), 462 – 475 .
   Web of Science ®Google Scholar
• S. L. Hakimi , E. E. Schmeichel and M. Labbe , On locating path- or tree-shaped facilities on networks . appear in Networks.
   Google Scholar
• G. Y. Handler and P. Mirchandani , Location on Networks . MIT Press , Cambridge , MA , 1979 .
   Google Scholar
• W. Lo and S. Peng , Efficient algorithms for finding a core of a tree with a specified length . Frontiers '92 4th Symposium on Frontiers of Massively Parallel Computation ( 1992 ), 59 – 67 .
   Google Scholar
• G. L. Miller and J. Reif , Parallel tree contraction and its applications . 26th IEEE Symp. on Foundations of Computer Science ( May 1985 ), 478 – 489 .
   Google Scholar
• E. Minicka , The optimal location of a path or tree in a tree network . Networks 15 ( 1985 ), 309 – 321 .
   Google Scholar
• P. J. Slater On locating a facility to service areas in a network . Operations Research 29 , 3 ( May 1981 ), 523 – 531 .
   Web of Science ®Google Scholar
• P. J. Slater , Locating central paths in a graph . Transportation Science 16 , 1 ( 1982 ), 1 – 18 .
   Web of Science ®Google Scholar
• R. E. Tarjan and U. Vishkin , Finding biconnected components and computing tree functions in logarithmic parallel time . 25th IEEE Symp. on Foundations of Comp. Science ( 1984 ), 12 – 22 .
   Google Scholar
• U. Vishkin Synchronous Parallel Compulation—A Survey . TR-71 , Department of Computer Science, Courant Institute , NYU , 1983 .
   Google Scholar