On the location of Steiner points in uniformly-oriented Steiner trees.

DOI10.1016/S0020-0190(02)00208-9zbMath1043.90083OpenAlexW2003806381MaRDI QIDQ1853076

Pawel Winter, Benny K. Nielsen, Martin Zachariasen

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00208-9

zbMATH Keywords

Computational geometrySteiner treesInterconnection networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Rotationally optimal spanning and Steiner trees in uniform orientation metrics

Uses Software

• GeoSteiner

Cites Work

• Unnamed Item
• A linear time algorithm for full Steiner trees
• The Steiner tree problem
• Minimum Networks in Uniform Orientation Metrics

This page was built for publication: On the location of Steiner points in uniformly-oriented Steiner trees.