scientific article; zbMATH DE number 3912403
From MaRDI portal
Publication:3689203
Recommendations
Cited in
(44)- The Steiner ratio conjecture is true for five points
- Steiner minimal trees for regular polygons
- Steiner minimal trees on sets of four points
- Mathematical problems and games
- An algorithm for determining an opaque minimal forest of a convex polygon
- A decomposition theorem on Euclidean Steiner minimal trees
- The Steiner problem with edge lengths 1 and 2
- Analytic formulas for full Steiner trees
- Some upper bounds for minimal trees
- A primer of the Euclidean Steiner problem
- On Steiner ratio conjectures
- The Steiner ratio conjecture for cocircular points
- A proof of the Gilbert-Pollak conjecture on the Steiner ratio
- How to find Steiner minimal trees in Euclidean \(d\)-space
- On Steiner minimal trees with \(L_ p\) distance
- A continuous version of a result of Du and Hwang
- Rectilinear spanning trees versus bounding boxes
- On greedy heuristic for Steiner minimum trees
- Steiner minimal trees in \(L^ 2_ p\)
- On the restricted 1-Steiner tree problem
- Insight into the computation of Steiner minimal trees in Euclidean space of general dimension
- 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
- Geometric multicut: shortest fences for separating groups of objects in the plane
- Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem
- Upper and lower bounds for the lengths of Steiner trees in 3-space
- Approximate Euclidean Steiner trees
- The Steiner ratio Gilbert-Pollak conjecture is still open
- Approximations for two variants of the Steiner tree problem in the Euclidean plane \(\mathbb R^2\)
- Approximations and lower bounds for the length of minimal Euclidean Steiner trees
- Minimum cost globally rigid subgraphs
- Computing minimum 2-edge-connected Steiner networks in the Euclidean plane
- The Steiner Problem for Count Matroids
- Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in E^ 3
- Solving the prize‐collecting Euclidean Steiner tree problem
- Approximation algorithms for solving the 1-line minimum Steiner tree of line segments problem
- The two-squirrel problem and its relatives
- On better heuristics for Steiner minimum trees
- Two trees are better than one
- The Euclidean MST-ratio for bi-colored lattices
- On approximability of Steiner tree in _p-metrics
- Streaming algorithms for geometric Steiner forest
- Approximation algorithms for constructing Steiner trees in the Euclidean plane \(\mathbb{R}^2\) using stock pieces of materials with fixed length
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3689203)
