On the restricted \(k\)-Steiner tree problem
type: Item
instance of: scholarly article
title: On the restricted \(k\)-Steiner tree problem
zbMATH Open document ID: 1504.90111
author: Prosenjit Bose
author: Anthony D'Angelo
author: Stephane Durocher
published in: Journal of Combinatorial Optimization
publication date: 2022-10-18T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7603298
zbMATH Keywords: minimum \(k\)-Steiner tree
zbMATH Keywords: Steiner point restrictions
zbMATH Keywords: computational geometry
zbMATH Keywords: combinatorial optimization
MaRDI profile type: Publication
full work available at URL: s10878-021-00808-z
OpenAlex ID: W3199358935
cites work: Exact algorithms for the bottleneck Steiner tree problem
cites work: On exact solutions to the Euclidean bottleneck Steiner tree problem
cites work: Q4508365
cites work: Q5452284
cites work: Steiner minimal trees for a class of zigzag lines
cites work: On the restricted 1-Steiner tree problem
cites work: Approximating geometric bottleneck shortest paths
cites work: Minimal Steiner trees for \(2^ k \times 2^ k\) square lattices
cites work: On the history of the Euclidean Steiner tree problem
cites work: Generalised \(k\)-Steiner tree problems in normed planes
cites work: Full minimal Steiner trees on lattice sets
cites work: Minimal Steiner trees for rectangular arrays of lattice points
cites work: On the complexity of the Steiner problem
cites work: Optimal interconnection trees in the plane. Theory, algorithms and applications
cites work: An optimal algorithm for constructing oriented Voronoi diagrams and geograph neighborhood graphs
cites work: The power of geometric duality
cites work: A constrained minimum spanning tree problem
cites work: Finding Minimum Spanning Trees
cites work: Steiner Trees for Ladders
cites work: Q3689203
cites work: Steiner Minimal Trees on Zig-Zag Lines
cites work: Constructing Arrangements of Lines and Hyperplanes with Applications
cites work: On the Zone Theorem for Hyperplane Arrangements
cites work: The Complexity of Computing Steiner Minimal Trees
cites work: The 1-steiner tree problem
cites work: Steiner Minimal Trees
cites work: Q5358292
cites work: Fast Algorithms for Finding Nearest Common Ancestors
cites work: Q4691686
cites work: Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem
cites work: Transitions in geometric minimum spanning trees
cites work: Q3992847
cites work: Degree-five Steiner points cannot reduce network costs for planar sets
cites work: Steiner Trees for Terminals Constrained to Curves
cites work: On Finding Lowest Common Ancestors: Simplification and Parallelization
cites work: Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs
cites work: Short trees in polygons
DOI: 10.1007/S10878-021-00808-Z
description: scientific article; zbMATH DE number 7603298