An algorithm for the steiner problem in the euclidean plane

DOI10.1002/NET.3230150305MaRDI QIDQ3713880zbMATH OpenOpenAlexFDO

Authors Pawel Winter

Publication date 1985

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230150305

zbMATH Keywords

exact solutionSteiner treesSteiner problem in the Euclidean plane

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Extremal problems in graph theory (05C35)

Recommendations

• Euclidean Steiner minimum trees: An improved exact algorithm
• An Improved Algorithm for Steiner Trees
• scientific article; zbMATH DE number 1424547
• Exact computation of Steiner minimal trees in the plane
• scientific article; zbMATH DE number 1305548

Cites work

• scientific article; zbMATH DE number 3096276 (Why is no real title available?)
• On the Problem of Steiner

Cited in

(34)

• Grade of service Steiner minimum trees in the Euclidean plane
• An improved algorithm for computing Steiner minimal trees in Euclidean d-space
• Computing Euclidean Steiner trees over segments
• Insight into the computation of Steiner minimal trees in Euclidean space of general dimension
• An Improved Algorithm for Steiner Trees
• Improved computation of plane Steiner minimal trees
• Numerical approximation of the Steiner problem in dimension 2 and 3
• An exact algorithm for the Euclidean k-Steiner tree problem
• A Dynamic Adaptive Relaxation Scheme Applied to the Euclidean Steiner Minimal Tree Problem
• scientific article; zbMATH DE number 1424547 (Why is no real title available?)
• scientific article; zbMATH DE number 1947438 (Why is no real title available?)
• Steiner hull algorithm for the uniform orientation metrics
• O(n log n)-average-time algorithm for shortest network under a given topology
• Rectilinear Steiner trees in narrow strips
• Geometry-experiment algorithm for Steiner minimal tree problem
• scientific article; zbMATH DE number 599372 (Why is no real title available?)
• scientific article; zbMATH DE number 819133 (Why is no real title available?)
• A neural network for the Steiner minimal tree problem
• Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs
• How to find Steiner minimal trees in Euclidean \(d\)-space
• A primer of the Euclidean Steiner problem
• Steiner minimal trees for three points with one convex polygonal obstacle
• The role of Steiner hulls in the solution to Steiner tree problems
• Two new criteria for finding Steiner hulls in Steiner tree problems
• Mathematical optimization models for the Euclidean Steiner tree problem in \(\mathbb{R}^d\)
• Local optimization in the Steiner problem on the Euclidean plane
• A heuristic for Euclidean and rectilinear Steiner problems
• A direct solution of allocation problems
• scientific article; zbMATH DE number 4016557 (Why is no real title available?)
• The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study
• Conversion of the Steiner problem on the Euclidean plane to the Steiner problem on graph
• Reorganizing topologies of Steiner trees to accelerate their eliminations
• An algorithm for finding 4-degree Steiner trees with a special topology
• An overview of exact algorithms for the Euclidean Steiner tree problem in n-space

This page was built for publication: An algorithm for the steiner problem in the euclidean plane

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