On the restricted 1-Steiner tree problem
From MaRDI portal
Publication:2019490
DOI10.1007/978-3-030-58150-3_36OpenAlexW3082680025MaRDI QIDQ2019490
Stephane Durocher, Prosenjit Bose, Anthony D'Angelo
Publication date: 21 April 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-58150-3_36
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An optimal algorithm for constructing oriented Voronoi diagrams and geograph neighborhood graphs
- The power of geometric duality
- A sweepline algorithm for Voronoi diagrams
- Steiner minimal trees for a class of zigzag lines
- Transitions in geometric minimum spanning trees
- Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs
- Short trees in polygons
- Full minimal Steiner trees on lattice sets
- Minimal Steiner trees for rectangular arrays of lattice points
- A constrained minimum spanning tree problem
- On the complexity of the Steiner problem
- Approximating geometric bottleneck shortest paths
- Minimal Steiner trees for \(2^ k \times 2^ k\) square lattices
- On the history of the Euclidean Steiner tree problem
- Generalised \(k\)-Steiner tree problems in normed planes
- Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem
- Optimal interconnection trees in the plane. Theory, algorithms and applications
- Voronoi Diagrams and Delaunay Triangulations
- Steiner Trees for Terminals Constrained to Curves
- Fast Algorithms for Finding Nearest Common Ancestors
- Steiner Minimal Trees on Zig-Zag Lines
- The 1-steiner tree problem
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- Degree-five Steiner points cannot reduce network costs for planar sets
- On the Zone Theorem for Hyperplane Arrangements
- Finding Minimum Spanning Trees
- Steiner Trees for Ladders
- The Complexity of Computing Steiner Minimal Trees
- Steiner Minimal Trees
This page was built for publication: On the restricted 1-Steiner tree problem
