Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem
From MaRDI portal
Publication:2292156
Recommendations
- On approximations for constructing 1-line minimum rectilinear Steiner trees in the Euclidean plane \(\mathbb{R}^2\)
- \(1\)-line minimum rectilinear Steiner trees and related problems
- On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\)
- Approximation algorithms for solving the line-capacitated minimum Steiner tree problem
- On the restricted \(k\)-Steiner tree problem
Cites work
- scientific article; zbMATH DE number 3912403 (Why is no real title available?)
- scientific article; zbMATH DE number 1775442 (Why is no real title available?)
- A constrained minimum spanning tree problem
- An improved LP-based approximation for Steiner tree
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Combinatorial optimization. Theory and algorithms.
- Computational geometry. Algorithms and applications.
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Steiner Minimal Trees
- Steiner minimal trees
- Steiner tree problems
- The Complexity of Computing Steiner Minimal Trees
- The Steiner problem with edge lengths 1 and 2
- The design of approximation algorithms
- Tighter Bounds for Graph Steiner Tree Approximation
- Variations on the Euclidean Steiner tree problem and algorithms
Cited in
(10)- 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\)
- Variations on the Euclidean Steiner tree problem and algorithms
- \(1\)-line minimum rectilinear Steiner trees and related problems
- Approximation algorithms for solving the 1-line minimum Steiner tree of line segments problem
- An exact algorithm for the line-constrained bottleneck \(k\)-Steiner tree problem
- On the restricted \(k\)-Steiner tree problem
- Approximation algorithms for solving the line-capacitated minimum Steiner tree problem
- Computing Euclidean Steiner trees over segments
- On the restricted 1-Steiner tree problem
This page was built for publication: Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292156)
