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

DOI10.1016/S0020-0190(02)00208-9MaRDI QIDQ1853076zbMATH OpenOpenAlexFDO

Authors Benny K. Nielsen, Pawel Winter, 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 geometryInterconnection networksSteiner trees

Mathematics Subject Classification ID

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

Recommendations

• Canonical forms and algorithms for Steiner trees in uniform orientation metrics
• Steiner trees for fixed orientation metrics
• The Steiner tree problem in orientation metrics
• Reducing the Steiner problem in four uniform orientations
• Steiner trees in general nonuniform orientations

Cites work

• A linear time algorithm for full Steiner trees
• scientific article; zbMATH DE number 1947438 (Why is no real title available?)
• Minimum networks in uniform orientation metrics
• The Steiner tree problem

Cited in

(6)

• Steiner trees for fixed orientation metrics
• The Steiner tree problem in orientation metrics
• Steiner trees in uniformly quasi-bipartite graphs.
• Rotationally optimal spanning and Steiner trees in uniform orientation metrics
• Canonical forms and algorithms for Steiner trees in uniform orientation metrics
• Reducing the Steiner problem in four uniform orientations

Describes a project that uses

Uses Software

• GeoSteiner

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853076)