Variations on the Euclidean Steiner tree problem and algorithms
From MaRDI portal
Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Abstract computational complexity for mathematical programming problems (90C60)
Recommendations
- Two heuristics for the Euclidean Steiner tree problem
- Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem
- scientific article; zbMATH DE number 1339503
- A Genetic Algorithm for Solving the Euclidean Non-Uniform Steiner Tree Problem
- New heuristics for the Euclidean Steiner problem in \(\mathbb{R}^n\)
Cited in
(15)- On the restricted 1-Steiner tree problem
- 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 restricted k-Steiner tree problem
- Approximation algorithms for solving the line-capacitated minimum Steiner tree problem
- Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem
- Approximations for two variants of the Steiner tree problem in the Euclidean plane \(\mathbb R^2\)
- Euclidean Steiner trees optimal with respect to swapping 4-point subtrees
- Combination algorithms for Steiner tree variants
- Algorithms for degree-constrained Euclidean Steiner minimal tree
- A Genetic Algorithm for Solving the Euclidean Non-Uniform Steiner Tree Problem
- 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
- Approximation algorithm for solving the 1-line Steiner tree problem with minimum number of Steiner points
- On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\)
This page was built for publication: Variations on the Euclidean Steiner tree problem and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4691686)
