Approximation algorithms for solving the 1-line minimum Steiner tree of line segments problem
From MaRDI portal
Publication:6601971
Recommendations
- Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem
- \(1\)-line minimum rectilinear Steiner trees and related problems
- On approximations for constructing 1-line minimum rectilinear Steiner trees in the Euclidean plane \(\mathbb{R}^2\)
- On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\)
- Minimum spanning tree of line segments
Cites work
- scientific article; zbMATH DE number 3912403 (Why is no real title available?)
- A constrained minimum spanning tree problem
- A minimum spanning tree algorithm with inverse-Ackermann type complexity
- An optimal minimum spanning tree algorithm
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
- Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Combinatorial optimization. Theory and algorithms.
- Computational geometry. Algorithms and applications.
- Computing Euclidean Steiner trees over segments
- Finding Least-Distances Lines
- Finding Minimum Spanning Trees
- Growing a Tree from Its Branches
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
- Minimum spanning tree of line segments
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Planar bichromatic minimum spanning trees
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Solving Steiner trees: Recent advances, challenges, and perspectives
- Steiner Minimal Trees
- Steiner minimal trees
- Steiner tree approximation via iterative randomized rounding
- Steiner tree problems
- The Complexity of Computing Steiner Minimal Trees
- The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study
- The design of approximation algorithms
- Tighter Bounds for Graph Steiner Tree Approximation
- Variations on the Euclidean Steiner tree problem and algorithms
This page was built for publication: Approximation algorithms for solving the 1-line minimum Steiner tree of line segments problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6601971)
