Pages that link to "Item:Q1603516"
From MaRDI portal
The following pages link to An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane (Q1603516):
Displaying 17 items.
- Steiner tree problem with minimum number of Steiner points and bounded edge-length (Q294609) (← links)
- An optimal algorithm for the Euclidean bottleneck full Steiner tree problem (Q390152) (← links)
- 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)
- An exact algorithm for the bottleneck 2-connected \(k\)-Steiner network problem in \(L_p\) planes (Q908293) (← links)
- Approximations for a bottleneck Steiner tree problem (Q1348905) (← links)
- Optimal and approximate bottleneck Steiner trees (Q1362990) (← links)
- Bottleneck Steiner tree with bounded number of Steiner vertices (Q2253907) (← links)
- The Euclidean bottleneck full Steiner tree problem (Q2258077) (← links)
- Optimal relay location for resource-limited energy-efficient wireless communication (Q2433926) (← links)
- Approximations for two variants of the Steiner tree problem in the Euclidean plane \(\mathbb R^2\) (Q2434638) (← links)
- The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition (Q2441579) (← links)
- On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem (Q3605490) (← links)
- A flow‐dependent quadratic steiner tree problem in the Euclidean plane (Q4642476) (← links)
- (Q4945797) (← links)
- An exact algorithm for the line-constrained bottleneck \(k\)-Steiner tree problem (Q6606207) (← links)
