Pages that link to "Item:Q5927652"

The following pages link to Approximations for Steiner trees with minimum number of Steiner points (Q5927652):

Displaying 17 items.

• A survey on relay placement with runtime and approximation guarantees (Q465673) (← links)
• An exact algorithm for minimum CDS with shortest path constraint in wireless networks (Q537641) (← links)
• Spatio-temporal multi-robot routing (Q900215) (← links)
• An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane (Q1603516) (← 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)
• CONSTRAINED RELAY NODE DEPLOYMENT FOR UNDERWATER ACOUSTIC WIRELESS SENSOR NETWORKS (Q2905310) (← links)
• A Sensor Deployment Strategy in Bus-Based Hybrid Ad-Hoc Networks (Q3467848) (← links)
• Optimal deployment of indoor wireless local area networks (Q6179700) (← links)