ZIB

Treffer pro Seite

Treffer 1 - 1 | 1 Treffer

Sortierung

Digitale Medien

An O(n log n) Average Time Algorithm for Computing the Shortest Network under a Given Topology (1999)

Xue, G. ; Du, D.-Z.

Springer

Algorithmica 23 (1999), S. 354-362

zur Merkliste hinzufügen auf der Merkliste

Details

ISSN: 1432-0541

Schlagwort(e): Key words. Analysis of algorithms, Steiner minimum trees, Shortest network under a given topology.

Quelle: Springer Online Journal Archives 1860-2000

Thema: Informatik , Mathematik

Notizen: Abstract. In 1992 F. K. Hwang and J. F. Weng published an O(n 2 ) time 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 improve substantially 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 present an improved Hwang—Weng algorithm. While the worst-case time complexity of our algorithm is still O(n 2 ) , its average time complexity over all the full Steiner topologies interconnecting n fixed points is O (n log n ).

Materialart: Digitale Medien

URL: http://dx.doi.org/10.1007/PL00009266

Permalink

Bibliothek	Standort	Signatur	Band/Heft/Jahr	Verfügbarkeit

Andere fanden auch interessant ...

Artikel (Nationallizenzen)

Volltext

Treffer 1 - 1 | 1 Treffer