Abstract
The Steiner tree problem considered in this paper is that of finding a network of minimum length connecting a given setK of terminals in a regionR of the Euclidean plane. ASteiner hull forK inR is any subregion ofR known to contain a Steiner tree forK inR. Two new criteria are given for finding Steiner hulls—one for the Steiner tree problem on plane graphs and one for the rectilinear Steiner tree problem—which strengthen known polynomial-time methods of finding Steiner hulls.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aho, A. V., M. R. Garey, and H. W. Hwang (1977). Rectilinear Steiner trees: efficient special-case algorithms,Networks 7, 37–58.
Bienstock, D., and C. L. Monma (1989). Optimal enclosing regions in planar graphs,Networks 19, 79–94.
Cockayne, E. J. (1970). On the efficiency of the algorithm for Steiner minimal trees,SIAM J. Appl. Math. 18, 150–159.
Duin, C. W., and A. Volgenant (1089). An edge elimination test for the Steiner problem in graphs,Oper. Res. Lett. 8, 79–83.
Dreyfus, E. W., and R. A. Wagner (1972). The Steiner problem in graphs,Networks 1, 195–207.
Erickson, R. E., C. L. Monma, and A. F. Vienott (1987). Send-and-split method for minimum concave-cost network flows,Math. Oper. Res. 12, 634–664.
Fredman, M. L., and R. E. Tarjan (1987). Fibonacci heaps and their uses in improved network optimization algorithms,J. Assoc. Comput. Mach. 34, 596–615.
Garey, M. R., R. L. Graham, and D. S. Johnson (1977). The complexity of computing Steiner minimal trees,SIAM J. Appl. Math. 32, 835–859.
Garey, M. R., and D. S. Johnson (1977). The rectilinear Steiner tree problem is NP-complete,SIAM J. Appl. Math. 32, 826–834.
Gilbert, E. N., and H. O. Pollak (1968). Steiner minimal trees,SIAM J. Appl. Math. 16, 1–29.
Hakimi, S. L. (1971). Steiner's problem in graphs and its implications,Networks 1, 113–133.
Hanan, M. (1966). On Steiner's problem with rectilinear distance,SIAM J. Appl. Math. 14, 255–265.
Hwang, F. K., and D. S. Richards (1989). Steiner tree problems,Networks, to appear.
Hwang, F. K., G. D. Song, G. Y. Ting, and D. Z. Hu (1988). A decomposition theorem on Euclidean Steiner minimal trees,Discrete and Comput. Geom. 3, 367–382.
Melzak, Z. A. (1961). On the problem of Steiner,Canad. Math. Bull. 4, 143–148.
Provan, J. S. (1988). Convexity and the Steiner tree problem,Networks 18, 55–72.
Provan, J. S. (1988). An approximation scheme for finding Steiner trees with obstacles,SIAM J. Comput. 17, 920–934.
Provan, J. S. (1989). Shortest enclosing walks and cycles in embedded graphs,Inform. Process. Lett. 30, 119–125.
Provan, J. S. (1989). The Role of Steiner Hulls in the Solution to Steiner Tree Problems,Proceedings of the NATO Advanced Research Workshop on Topological Network Design: Analysis and Synthesis. To appear inAnnals of Operations Research.
Smith, J. M., and P. Winter (1989). Computational geometry and topological network design,Proceedings of the NATO Advanced Research Workshop on Topological Network Design: Analysis and Synthesis. To appear inAnnals of Operations Research.
Winter, P. (1985). An algorithm for the Steiner problem in the Euclidean plane.Networks 15, 323–345.
Winter, P. (1987). Steiner problem in networks: a survey.Networks 17, 129–167.
Yang, Y. Y., and O. Wing (1972). Optimal and suboptimal algorithms for the wiring problem,Proc. IEEE International Symposium on Circuit Theory, pp. 154–158.
Author information
Authors and Affiliations
Additional information
Communicated by F. K. Hwang.
This research was supported by the Air Force Office of Scientific Research under Grant AFOSR-84-0140. Reproduction in whole or part is permitted for any purpose of the United States Government.
Rights and permissions
About this article
Cite this article
Provan, J.S. Two new criteria for finding Steiner hulls in Steiner tree problems. Algorithmica 7, 289–302 (1992). https://doi.org/10.1007/BF01758763
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01758763