On the restricted 1-Steiner tree problem
type: Item
instance of: scholarly article
title: On the restricted 1-Steiner tree problem
DOI: 10.1007/978-3-030-58150-3_36
author: Prosenjit Bose
author: Anthony D'Angelo
author: Stephane Durocher
publication date: 2021-04-21T00:00:00Z
Mathematics Subject Classification ID: 68Rxx
zbMATH DE Number: 7336125
zbMATH Keywords: minimum k-Steiner tree
zbMATH Keywords: Steiner point restrictions
MaRDI profile type: Publication
full work available at URL: 978-3-030-58150-3 36
OpenAlex ID: W3082680025
cites work: Voronoi diagrams and Delaunay triangulations
cites work: Q4508365
cites work: Q5452284
cites work: Steiner minimal trees for a class of zigzag lines
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: Q3689203
cites work: Steiner Trees for Ladders
cites work: Steiner Minimal Trees on Zig-Zag Lines
cites work: On the Zone Theorem for Hyperplane Arrangements
cites work: A sweepline algorithm for Voronoi diagrams
cites work: The Complexity of Computing Steiner Minimal Trees
cites work: The 1-steiner tree problem
cites work: Steiner Minimal Trees
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: Q3694703
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
Recommended article: On the restricted \(k\)-Steiner tree problem
Recommended article: The 1-steiner tree problem
Recommended article: A constrained Steiner tree problem
Recommended article: Q4779183
Recommended article: On the number of minimal 1-Steiner trees
Recommended article: The Rectilinear Steiner Tree Problem with Given Topology and Length Restrictions
Recommended article: Q4400842
Recommended article: Approximating Steiner trees in graphs with restricted weights
Recommended article: The Steiner tree problem on graphs: inapproximability results
Recommended article: On the Minimum Diameter Cost-Constrained Steiner Tree Problem
description: scientific article; zbMATH DE number 7336125