@inproceedings{36d1aab40cab4b748f656d64013d00e9,

title = "O(n log n)-average-time algorithm for shortest network under a given topology",

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.",

keywords = "Analysis of algorithms, Shortest network under a given topology, Steiner minimum trees",

author = "Guoliang Xue and Du, {D. Z.}",

year = "1996",

doi = "10.1007/3-540-61332-3_134",

language = "English (US)",

isbn = "9783540613329",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "11--20",

editor = "Jin-Yi Cai and Wong, {Chak Kuen} and Wong, {Chak Kuen}",

booktitle = "Computing and Combinatorics - 2nd Annual International Conference, COCOON 1996, Proceedings",

note = "2nd Annual International Conference on Computing and Combinatorics, COCOON 1996 ; Conference date: 17-06-1996 Through 19-06-1996",

}