The 1-steiner tree problem

DOI10.1016/0196-6774(87)90032-0MaRDI QIDQ3783604zbMATH OpenOpenAlexFDO

Authors George F. Georgakopoulos, Christos Papadimitriou

Publication date 1987

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(87)90032-0

zbMATH Keywords

1-Steiner tree problemcombinatorial optimizationcomputational geometry

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)

Recommendations

• The Steiner tree problem
• On the restricted 1-Steiner tree problem
• Steiner tree problems
• Steiner tree problems
• scientific article; zbMATH DE number 1182759
• On the number of minimal 1-Steiner trees
• The full Steiner tree problem
• scientific article; zbMATH DE number 4010182
• scientific article; zbMATH DE number 3871417
• A constrained Steiner tree problem

Cited in

(20)

• How to find Steiner minimal trees in Euclidean \(d\)-space
• Local optimization of neuron arbors
• Transitions in geometric minimum spanning trees
• The Steiner tree problem
• On the number of minimal 1-Steiner trees
• A constrained minimum spanning tree problem
• Low-degree minimum spanning trees
• Steiner minimal trees in \(L^ 2_ p\)
• On the restricted 1-Steiner tree problem
• 1-line minimum rectilinear Steiner trees and related problems
• On the restricted k-Steiner tree problem
• Generalised \(k\)-Steiner tree problems in normed planes
• The 1-Steiner-Minimal-Tree problem in Minkowski-spaces
• The One-Terminal TELPAK Problem
• An exact algorithm for the Euclidean k-Steiner tree problem
• An exact algorithm for the line-constrained bottleneck \(k\)-Steiner tree problem
• An improved exact algorithm for the Euclidean k-Steiner tree problem
• On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\)
• Survivable minimum bottleneck networks
• An optimal algorithm for constructing oriented Voronoi diagrams and geograph neighborhood graphs

This page was built for publication: The 1-steiner tree problem

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