Pages that link to "Item:Q1068839"
From MaRDI portal
The following pages link to A linear time algorithm for full Steiner trees (Q1068839):
Displayed 23 items.
- The full Steiner tree problem (Q702772) (← links)
- An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space (Q951125) (← links)
- Hexagonal coordinate systems and Steiner minimal trees (Q1080858) (← links)
- Fast heuristic algorithms for rectilinear Steiner trees (Q1118419) (← links)
- A primer of the Euclidean Steiner problem (Q1179729) (← links)
- How to find Steiner minimal trees in Euclidean \(d\)-space (Q1186793) (← links)
- Improved computation of plane Steiner minimal trees (Q1186797) (← links)
- A heuristic for Euclidean and rectilinear Steiner problems (Q1194744) (← links)
- Fixed topology Steiner trees and spanning forests (Q1285596) (← links)
- Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs (Q1315998) (← links)
- Local search for the Steiner tree problem in the Euclidean plane (Q1806730) (← links)
- On the location of Steiner points in uniformly-oriented Steiner trees. (Q1853076) (← links)
- Rotationally optimal spanning and Steiner trees in uniform orientation metrics (Q1886240) (← links)
- On the structure and complexity of the 2-connected Steiner network problem in the plane (Q1977645) (← links)
- Modeling of optimal networks by means of linkages (Q2055321) (← links)
- Insight into the computation of Steiner minimal trees in Euclidean space of general dimension (Q2064280) (← links)
- A multivariate analysis of the strict terminal connection problem (Q2306846) (← links)
- Upper and lower bounds for the lengths of Steiner trees in 3-space (Q2387794) (← links)
- Approximate Euclidean Steiner trees (Q2397467) (← links)
- Geometry and topology of local minimal 2-trees (Q4344725) (← links)
- A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ (Q4546061) (← links)
- GENERALIZED MELZAK'S CONSTRUCTION IN THE STEINER TREE PROBLEM (Q4818573) (← links)
- O(n log n)-average-time algorithm for shortest network under a given topology (Q6183623) (← links)