Abstract
Recently Rubinstein et al. gave a new proof of the NP-completeness of the discretized Steiner problem, that is, the problem of finding a shortest network connecting a given set of points in the plane where all vertices are integer points and a discretized metric is used. Their approach was to consider the complexity of the PALIMEST problem, the Steiner problem for sets of points lying on two parallel lines. In this paper, we give a new proof of this theorem, using simpler, more constructive arguments. We then extend the result to a more general class of networks known as APE-Steiner trees in which certain angles between edges or slopes of edges are specified beforehand.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Arora, “Polynomial-time approximation schemes for Euclidean TSP and other geometrical problems,” Proceedings of 37th IEEE Symp. on Foundations of Computer Science, 1996, pp. 2–12.
M. Brazil, D.A. Thomas, and J.F. Weng, “Gradient-constrained minimal Steiner trees,” in Network Design: Connectivity and Facilities Location (DIMACS Series in Discrete Mathematics and Theoretical Computer Science) vol. 40, P.M. Pardalos and D.Z. Du (Eds.), Amer. Math. Assoc., 1998, pp. 23–38.
M.R. Garey, R.L. Graham, and D.S. Johnson, “The complexity of computing Steiner minimal trees,” SIAM J. Appl. Math., vol. 32, pp. 835–859, 1977.
F.K. Hwang, “A linear time algorithm for full Steiner trees,” Oper. Res. Lett., vol. 5, pp. 235–237, 1986.
F.K. Hwang, D.S. Richard, and P. Winter, The Steiner Tree Problem, Elsvier Science Publishers: Amsterdam, 1992.
F.W. Kuhn, “Steiner's problem revisited,” in Studies in Optimization, Studies in Math. vol. 10, G.B. Dantzig and B.C. Eaves (Eds.), Amer. Math. Assoc., 1975, pp. 53–70.
Z.A. Melzak, “On the problem of Steiner,” Canad. Math. Bull., vol. 4, pp. 143–148, 1961.
J.H. Rubinstein, D.A. Thomas, and N.C. Wormald, “Steiner trees for terminals constrained to curves,” SIAM J. Discrete Math., vol. 10, pp. 1–17, 1977.
J.F. Weng, “A new model of generalized Steiner trees and 3–coordinate systems,” in Network Design: Connectivity and Facilities Location (DIMACS Series in Discrete Mathematics and Theoretical Computer Science) vol. 40, P.M. Pardalos and D.Z. Du (Eds.), Amer. Math. Assoc., pp. 415–424, 1998.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Brazil, M., Thomas, D. & Weng, J. On the Complexity of the Steiner Problem. Journal of Combinatorial Optimization 4, 187–195 (2000). https://doi.org/10.1023/A:1009846620554
Issue Date:
DOI: https://doi.org/10.1023/A:1009846620554