The 1-steiner tree problem
From MaRDI portal
Publication:3783604
DOI10.1016/0196-6774(87)90032-0zbMath0642.68131OpenAlexW2074664638MaRDI QIDQ3783604
Christos H. Papadimitriou, George F. Georgakopoulos
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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)
Related Items (15)
On the number of minimal 1-Steiner trees ⋮ On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\) ⋮ The 1-Steiner-Minimal-Tree problem in Minkowski-spaces ⋮ Low-degree minimum spanning trees ⋮ Steiner minimal trees in \(L^ 2_ p\) ⋮ Survivable minimum bottleneck networks ⋮ An optimal algorithm for constructing oriented Voronoi diagrams and geograph neighborhood graphs ⋮ How to find Steiner minimal trees in Euclidean \(d\)-space ⋮ Local optimization of neuron arbors ⋮ Transitions in geometric minimum spanning trees ⋮ Generalised \(k\)-Steiner tree problems in normed planes ⋮ On the restricted 1-Steiner tree problem ⋮ A constrained minimum spanning tree problem ⋮ \(1\)-line minimum rectilinear Steiner trees and related problems ⋮ On the restricted \(k\)-Steiner tree problem
This page was built for publication: The 1-steiner tree problem
