Abstract
In 1992, F.K. Hwang and J.F. Weng published an O(n 2) operation algorithm for computing the shortest network under a given full Steiner topology interconnecting n fixed points in the Euclidean plane. The Hwang-Weng algorithm can be used to substantially improve existing algorithms for the Steiner minimum tree problem because it reduces the number of different Steiner topologies to be considered dramatically. In this paper, we prove that the Hwang-Weng algorithm can be improved to use O(n log n) operations in average.
The research of this author was supported in part by National Science Foundation grants No. NSF ASC-9409285 and NSF OSR-9350540.
The research of this author was supported in part by the NSF under grant CCR 9208913.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
E.J. Cockayne and D.E. Hewgill, Exact computation of Steiner minimal trees in the Euclidean plane, Information Processing Letters, Vol. 22(1986), pp. 151–156.
D.-Z. Du and F.K. Hwang, A proof of Gilbert-Pollak's conjecture on the Steiner ratio, Algorithmica, Vol. 7(1992), pp. 121–135.
D.-Z. Du, Y. Zhang and Q. Feng, On better heuristic for Euclidean Steiner minimum trees, In Proc. 32nd IEEE Symp. Found. Comp. Sci. (1991), pp. 431–439.
M.R. Garey, R.L. Graham and D.S. Johnson, The complexity of computing Steiner minimal trees, SIAM Journal on Applied Mathematics, Vol. 32(1977), pp. 835–859.
E.N. Gilbert and H.O. Pollak, Steiner minimal trees, SIAM Journal on Applied Mathematics, Vol. 16(1968), pp. 1–29.
F.K. Hwang, A linear time algorithm for full Steiner trees, Operations Research Letters, Vol. 4(1986), pp. 235–237.
F.K. Hwang, D.S. Richards and P. Winter, The Steiner Tree Problem, North-Holland, 1992.
F.K. Hwang and J.F. Weng, The shortest network under a given topology, Journal of Algorithms, Vol. 13(1992), pp. 468–488.
Z.A. Melzak, On the problem of Steiner, Canadian Mathematical Bulletin, Vol. 16(1961), pp. 143–148.
D. Trietsch and F.K. Hwang, An improved algorithm for Steiner trees, SIAM Journal on Applied Mathematics, Vol. 50(1990), pp. 244–263.
P. Winter, An algorithm for the Steiner problem in the Euclidean plane, Networks, Vol. 15(1985), pp. 323–345.
A. Zelikovsky, An 11/6-approximation algorithm for the network Steiner problem, Algorithmica, Vol. 9(1993), pp. 463–470.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xue, G., Du, D.Z. (1996). O(n log n)-average-time algorithm for shortest network under a given topology. In: Cai, JY., Wong, C.K. (eds) Computing and Combinatorics. COCOON 1996. Lecture Notes in Computer Science, vol 1090. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61332-3_134
Download citation
DOI: https://doi.org/10.1007/3-540-61332-3_134
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61332-9
Online ISBN: 978-3-540-68461-9
eBook Packages: Springer Book Archive