Pages that link to "Item:Q2457920"
From MaRDI portal
The following pages link to Approximations and lower bounds for the length of minimal Euclidean Steiner trees (Q2457920):
Displaying 9 items.
- Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation (Q1028460) (← links)
- Some upper bounds for minimal trees (Q1178229) (← links)
- On Steiner minimal trees with \(L_ p\) distance (Q1186795) (← links)
- A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points (Q1607061) (← links)
- Insight into the computation of Steiner minimal trees in Euclidean space of general dimension (Q2064280) (← links)
- Upper and lower bounds for the lengths of Steiner trees in 3-space (Q2387794) (← links)
- Approximate Euclidean Steiner trees (Q2397467) (← links)
- (Q4448761) (← links)
- Reorganizing topologies of Steiner trees to accelerate their eliminations (Q5216441) (← links)