Pages that link to "Item:Q1362990"
From MaRDI portal
The following pages link to Optimal and approximate bottleneck Steiner trees (Q1362990):
Displaying 16 items.
- Exact algorithms for the bottleneck Steiner tree problem (Q652535) (← links)
- On exact solutions to the Euclidean bottleneck Steiner tree problem (Q765514) (← links)
- Survivable minimum bottleneck networks (Q904084) (← links)
- Approximating the selected-internal Steiner tree (Q995588) (← links)
- The stochastic bottleneck linear programming problem (Q1304778) (← 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)
- Generalised \(k\)-Steiner tree problems in normed planes (Q2258073) (← links)
- The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition (Q2441579) (← links)
- A catalog of Hanan grid problems (Q2748382) (← links)
- Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees (Q3595372) (← links)
- On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem (Q3605490) (← links)
- The bottleneck selected‐internal and partial terminal Steiner tree problems (Q4642405) (← links)
- (Q4945797) (← links)
- Approximating bottleneck spanning trees on partitioned tuples of points (Q5881545) (← links)
- An exact algorithm for the line-constrained bottleneck \(k\)-Steiner tree problem (Q6606207) (← links)
