An Improved Algorithm for Steiner Trees

DOI10.1137/0150015zbMath0697.05022OpenAlexW2096527938MaRDI QIDQ3474661

Dan Trietsch, Frank K. Hwang

Publication date: 1990

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0150015

zbMATH Keywords

Steiner treeEuclidean Steiner minimal tree problem

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Operations research and management science (90B99)

Related Items (4)

O(n log n)-average-time algorithm for shortest network under a given topology ⋮ A primer of the Euclidean Steiner problem ⋮ Pseudo-Gilbert-Steiner trees ⋮ Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs

This page was built for publication: An Improved Algorithm for Steiner Trees