Pages that link to "Item:Q1348905"
From MaRDI portal
The following pages link to Approximations for a bottleneck Steiner tree problem (Q1348905):
Displayed 14 items.
- The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\) (Q423908) (← links)
- Exact algorithms for the bottleneck Steiner tree problem (Q652535) (← links)
- On exact solutions to the Euclidean bottleneck Steiner tree problem (Q765514) (← links)
- The approximability of three-dimensional assignment problems with bottleneck objective (Q845547) (← 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)
- An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane (Q1603516) (← 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)
- 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)
- Fixed parameter tractability of a biconnected bottleneck Steiner network problem (Q6066052) (← links)
- Simplifying obstacles for Steiner network problems in the plane (Q6087564) (← links)