On the restricted 1-Steiner tree problem
From MaRDI portal
Publication:2019490
DOI10.1007/978-3-030-58150-3_36OpenAlexW3082680025MaRDI QIDQ2019490FDOQ2019490
Authors: Prosenjit Bose, Anthony D'Angelo, Stephane Durocher
Publication date: 21 April 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-58150-3_36
Recommendations
- On the restricted \(k\)-Steiner tree problem
- The 1-steiner tree problem
- A constrained Steiner tree problem
- scientific article; zbMATH DE number 1834686
- On the number of minimal 1-Steiner trees
- The rectilinear Steiner tree problem with given topology and length restrictions
- scientific article; zbMATH DE number 1182759
- Approximating Steiner trees in graphs with restricted weights
- The Steiner tree problem on graphs: inapproximability results
- On the minimum diameter cost-constrained Steiner tree problem
Cites Work
- Voronoi diagrams and Delaunay triangulations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computational geometry. Algorithms and applications.
- The power of geometric duality
- Steiner Minimal Trees
- A sweepline algorithm for Voronoi diagrams
- Fast Algorithms for Finding Nearest Common Ancestors
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- The Complexity of Computing Steiner Minimal Trees
- Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs
- Short trees in polygons
- Approximating geometric bottleneck shortest paths
- Transitions in geometric minimum spanning trees
- On the complexity of the Steiner problem
- On the Zone Theorem for Hyperplane Arrangements
- Generalised \(k\)-Steiner tree problems in normed planes
- Finding Minimum Spanning Trees
- Steiner Trees for Terminals Constrained to Curves
- Degree-five Steiner points cannot reduce network costs for planar sets
- Optimal interconnection trees in the plane. Theory, algorithms and applications
- Steiner Minimal Trees on Zig-Zag Lines
- Steiner Trees for Ladders
- Title not available (Why is that?)
- On the history of the Euclidean Steiner tree problem
- A constrained minimum spanning tree problem
- Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem
- The 1-steiner tree problem
- Variations on the Euclidean Steiner tree problem and algorithms
- An optimal algorithm for constructing oriented Voronoi diagrams and geograph neighborhood graphs
- Steiner minimal trees for a class of zigzag lines
- Full minimal Steiner trees on lattice sets
- Minimal Steiner trees for rectangular arrays of lattice points
- Minimal Steiner trees for \(2^ k \times 2^ k\) square lattices
Cited In (2)
This page was built for publication: On the restricted 1-Steiner tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019490)