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

Guoliang Xue, D. Z. Du

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationComputing and Combinatorics - 2nd Annual International Conference, COCOON 1996, Proceedings
EditorsJin-Yi Cai, Chak Kuen Wong, Chak Kuen Wong
PublisherSpringer Verlag
Pages11-20
Number of pages10
ISBN (Print)9783540613329
DOIs
StatePublished - 1996
Externally publishedYes
Event2nd Annual International Conference on Computing and Combinatorics, COCOON 1996 - Hong Kong, Hong Kong
Duration: Jun 17 1996Jun 19 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1090
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other2nd Annual International Conference on Computing and Combinatorics, COCOON 1996
CountryHong Kong
CityHong Kong
Period6/17/966/19/96

Keywords

  • Analysis of algorithms
  • Shortest network under a given topology
  • Steiner minimum trees

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'O(n log n)-average-time algorithm for shortest network under a given topology'. Together they form a unique fingerprint.

Cite this