Steiner tree problem with minimum number of Steiner points and bounded edge-length
From MaRDI portal
(Redirected from Publication:294609)
Recommendations
- Approximations for Steiner trees with minimum number of Steiner points
- An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane
- Approximations for Steiner trees with minimum number of Steiner points
- On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\)
- scientific article; zbMATH DE number 1796993
Cites work
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- A proof of the Gilbert-Pollak conjecture on the Steiner ratio
- Bottleneck Steiner trees in the plane
- On Minimum Cost Networks with Nonlinear Costs
- Steiner Minimal Trees
- The Complexity of Computing Steiner Minimal Trees
- The Steiner tree problem
Cited in
(32)- A sensor deployment strategy in bus-based hybrid ad-hoc networks
- The subdivision-constrained routing requests problem
- Minimum Steiner trees on a set of concyclic points and their center
- Approximating minimum Steiner point trees in Minkowski planes
- Algorithms for connected set cover problem and fault-tolerant connected set cover problem
- Approximations for Steiner trees with minimum number of Steiner points
- Constrained relay node deployment for underwater acoustic wireless sensor networks
- Spatio-temporal multi-robot routing
- The Euclidean bottleneck full Steiner tree problem
- scientific article; zbMATH DE number 1796993 (Why is no real title available?)
- Improving construction for connected dominating set with Steiner tree in wireless sensor networks
- The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition
- Approximation algorithms for constructing required subgraphs using stock pieces of fixed length
- Bottleneck Steiner tree with bounded number of Steiner vertices
- Optimal deployment of indoor wireless local area networks
- A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points
- Recovery from multiple simultaneous failures in wireless sensor networks using minimum Steiner tree
- Optimal relay location for resource-limited energy-efficient wireless communication
- Approximations for two variants of the Steiner tree problem in the Euclidean plane \(\mathbb R^2\)
- Relay placement for fault tolerance in wireless networks in higher dimensions
- Wire segmenting for buffer insertion based on RSTP-MSP
- scientific article; zbMATH DE number 5629898 (Why is no real title available?)
- Approximations for Steiner trees with minimum number of Steiner points
- Wireless networking, dominating and packing
- Relay placement for two-connectivity
- Approximations for constructing tree-form structures using specific material with fixed length
- Combination algorithms for Steiner tree variants
- An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane
- Improved approximation algorithms for single-tiered relay placement
- Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces
- Optimal relay node placement in delay constrained wireless sensor network design
- Approximation algorithms for constructing some required structures in digraphs
This page was built for publication: Steiner tree problem with minimum number of Steiner points and bounded edge-length
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294609)
