Pages that link to "Item:Q390152"
From MaRDI portal
The following pages link to An optimal algorithm for the Euclidean bottleneck full Steiner tree problem (Q390152):
Displaying 7 items.
- On the hardness of full Steiner tree problems (Q491161) (← links)
- On exact solutions to the Euclidean bottleneck Steiner tree problem (Q765514) (← links)
- Bottleneck bichromatic full Steiner trees (Q1628678) (← links)
- The Euclidean bottleneck full Steiner tree problem (Q2258077) (← links)
- Faster bottleneck non-crossing matchings of points in convex position (Q2401333) (← links)
- Euclidean Steiner trees optimal with respect to swapping 4-point subtrees (Q2448203) (← links)
- The balanced connected subgraph problem (Q5918764) (← links)