On the restricted 1-Steiner tree problem

DOI10.1007/978-3-030-58150-3_36MaRDI QIDQ2019490zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

minimum k-Steiner treeSteiner point restrictions

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

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

• scientific article; zbMATH DE number 3912403 (Why is no real title available?)
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 1512678 (Why is no real title available?)
• A constrained minimum spanning tree problem
• A sweepline algorithm for Voronoi diagrams
• An optimal algorithm for constructing oriented Voronoi diagrams and geograph neighborhood graphs
• Approximating geometric bottleneck shortest paths
• Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem
• Computational geometry. Algorithms and applications.
• Degree-five Steiner points cannot reduce network costs for planar sets
• Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs
• Fast Algorithms for Finding Nearest Common Ancestors
• Finding Minimum Spanning Trees
• Full minimal Steiner trees on lattice sets
• Generalised \(k\)-Steiner tree problems in normed planes
• Minimal Steiner trees for 2^ k 2^ k square lattices
• Minimal Steiner trees for rectangular arrays of lattice points
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• On the Zone Theorem for Hyperplane Arrangements
• On the complexity of the Steiner problem
• On the history of the Euclidean Steiner tree problem
• Optimal interconnection trees in the plane. Theory, algorithms and applications
• Short trees in polygons
• Steiner Minimal Trees
• Steiner Minimal Trees on Zig-Zag Lines
• Steiner Trees for Ladders
• Steiner Trees for Terminals Constrained to Curves
• Steiner minimal trees for a class of zigzag lines
• The 1-steiner tree problem
• The Complexity of Computing Steiner Minimal Trees
• The power of geometric duality
• Transitions in geometric minimum spanning trees
• Variations on the Euclidean Steiner tree problem and algorithms
• Voronoi diagrams and Delaunay triangulations

Cited in

(2)

• On the restricted \(k\)-Steiner tree problem
• The 1-steiner tree problem

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)