An exact algorithm for the uniformly-oriented Steiner tree problem

DOI10.1007/3-540-45749-6_66MaRDI QIDQ4411408zbMATH OpenFDO

Authors Benny K. Nielsen, Pawel Winter, Martin Zachariasen

Publication date 8 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2461/24610760.htm

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 1424547
• An algorithm for the steiner problem in the euclidean plane
• Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
• scientific article; zbMATH DE number 1305548
• Euclidean Steiner minimum trees: An improved exact algorithm

Cited in

(10)

• Steiner trees for fixed orientation metrics
• Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
• On the location of Steiner points in uniformly-oriented Steiner trees.
• Rotationally optimal spanning and Steiner trees in uniform orientation metrics
• A near linear time approximation scheme for Steiner tree among obstacles in the plane
• Canonical forms and algorithms for Steiner trees in uniform orientation metrics
• THE UNIFORM ORIENTATION STEINER TREE PROBLEM IS NP-HARD
• Flexibility of Steiner trees in uniform orientation metrics
• scientific article; zbMATH DE number 1305548 (Why is no real title available?)
• An exact branch and bound algorithm for the Steiner Problem in Graphs

Describes a project that uses

Uses Software

• GeoSteiner

This page was built for publication: An exact algorithm for the uniformly-oriented Steiner tree problem

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