Pages that link to "Item:Q294609"

The following pages link to Steiner tree problem with minimum number of Steiner points and bounded edge-length (Q294609):

Displaying 27 items.

• Improved approximation algorithms for single-tiered relay placement (Q266064) (← links)
• Optimal relay node placement in delay constrained wireless sensor network design (Q297218) (← links)
• Approximations for constructing tree-form structures using specific material with fixed length (Q315511) (← links)
• Relay placement for fault tolerance in wireless networks in higher dimensions (Q632722) (← links)
• Recovery from multiple simultaneous failures in wireless sensor networks using minimum Steiner tree (Q666113) (← links)
• Spatio-temporal multi-robot routing (Q900215) (← links)
• Algorithms for connected set cover problem and fault-tolerant connected set cover problem (Q1006053) (← links)
• An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane (Q1603516) (← links)
• A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points (Q1607061) (← links)
• Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces (Q1641150) (← links)
• Wireless networking, dominating and packing (Q1958633) (← links)
• Approximation algorithms for constructing required subgraphs using stock pieces of fixed length (Q2082192) (← links)
• Approximation algorithms for constructing some required structures in digraphs (Q2255946) (← links)
• The Euclidean bottleneck full Steiner tree problem (Q2258077) (← links)
• Relay placement for two-connectivity (Q2339829) (← 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 subdivision-constrained routing requests problem (Q2436672) (← links)
• The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition (Q2441579) (← links)
• Improving construction for connected dominating set with Steiner tree in wireless sensor networks (Q2505562) (← links)
• Combination algorithms for Steiner tree variants (Q2700384) (← links)
• CONSTRAINED RELAY NODE DEPLOYMENT FOR UNDERWATER ACOUSTIC WIRELESS SENSOR NETWORKS (Q2905310) (← links)
• Approximating minimum Steiner point trees in Minkowski planes (Q3064040) (← links)
• A Sensor Deployment Strategy in Bus-Based Hybrid Ad-Hoc Networks (Q3467848) (← links)
• Approximations for Steiner trees with minimum number of Steiner points (Q5958113) (← links)
• Wire segmenting for buffer insertion based on RSTP-MSP (Q5958123) (← links)
• Optimal deployment of indoor wireless local area networks (Q6179700) (← links)