Pages that link to "Item:Q2258077"
From MaRDI portal
The following pages link to The Euclidean bottleneck full Steiner tree problem (Q2258077):
Displaying 6 items.
- An optimal algorithm for the Euclidean bottleneck full Steiner tree problem (Q390152) (← links)
- On the hardness of full Steiner tree problems (Q491161) (← links)
- Approximations for a bottleneck Steiner tree problem (Q1348905) (← links)
- An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane (Q1603516) (← links)
- Bottleneck bichromatic full Steiner trees (Q1628678) (← links)
- Parameterized study of Steiner tree on unit disk graphs (Q2700383) (← links)