The 1-steiner tree problem
From MaRDI portal
Publication:3783604
DOI10.1016/0196-6774(87)90032-0zbMath0642.68131MaRDI 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
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
90C27: Combinatorial optimization
Related Items
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, 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\), The 1-Steiner-Minimal-Tree problem in Minkowski-spaces