Abstract
We formulate and investigate the Multi-Weighted Steiner Problem (MWS), a generalization of the Steiner problem in graphs, involving more than one weight function. As a special case, it contains the hierarchical network design problem. With the notion of "bottleneck length/distance", a min-max measure, we analyze the interaction between differently weighted edges in a solution. Combining the results with known methods for the Steiner problem in graphs and the hierarchical network design problem, two heuristics for the MWS are developed, one based on weight modifications and the other on exchanging edges. Both are of time complexityO(kv 2), withv the number of nodes andk the number of special nodes in the graph. The first is also suited for thedirected MWS; the second is expected to perform better on the undirected version. Before actually solving the Steiner problem in graphs and the hierarchical network design problem, preprocessing techniques exploiting tests to reduce the problem graphs have proven to be valuable. We adapt three prominent tests for use in the MWS.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Balakrishnan and N.R. Patel, Problem reduction methods and a tree generation algorithm for the Steiner network problem, Networks 17(1987)65–85.
J.E. Beasley, An algorithm for the Steiner problem in graphs, Networks 14(1984)147–159.
J.R. Current, C.S. Revelle and J.L. Cohon, The hierarchical network design problem, Eur. J. Oper. Res. 27(1986)57–66.
C.W. Duin and A. Volgenant, Some generalizations of the Steiner problem in graphs, Networks 17(1987)353–364.
C.W. Duin and A. Volgenant, Reducing the hierarchical network design problem, Eur. J. Oper. Res. 39(1989)332–344.
C.W. Duin and A. Volgenant, Reduction tests for the Steiner problem in graphs, Networks 19(1989)549–567.
C.W. Duin and A. Volgenant, An edge elimination test for the Steiner problem in graphs, Oper. Res. Lett. 8(1989)79–83.
C.W. Duin and A. Volgenant, Heuristics for the hierarchical network design problem, in:Twenty-five Years of Operations Research in The Netherlands: Papers dedicated to Gijs de Leve, ed. J.K. Lenstra, H. Tijms and A. Volgenant, CWI Tract 70 (Centre for Mathematics and Computer Science, Amsterdam, 1990), pp. 23–34.
E.W. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik 1(1959)269–271.
M.R. Garey and D.S. Johnson, The rectilinear Steiner tree problem is NP-complete, SIAM J. Appl. Math. 32(1977)826–834.
B. Gavish, Topological design of centralized computer networks — formulations and algorithms, Networks 12(1982)355–377.
L. Kou, G. Markowsky and L. Berman, A fast algorithm for Steiner trees, Acta Informatica 15(1981)141–145.
K. Mehlhorn, A faster approximation algorithm for the Steiner problem in graphs, Info. Proc. Lett. 27(1988)125–128.
R.C. Prim, Shortest connection networks and some generalizations, Bell. Syst. Tech. J. 36(1957)1389–1401.
H. Takahashi and A. Matsuyama, An approximate solution for the Steiner problem in graphs, Math. Japonica 24(1980) 573–577.
Y.F. Wu, P. Widmayer and C.K. Wong, A faster approximation algorithm for the Steiner problem in graphs, Acta Informatica 23(1986)223–229.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Duin, C., Volgenant, T. The multi-weighted Steiner tree problem. Ann Oper Res 33, 451–469 (1991). https://doi.org/10.1007/BF02071982
Issue Date:
DOI: https://doi.org/10.1007/BF02071982