Approximations for Steiner trees with minimum number of Steiner points

(6 + ε)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics

Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs

COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications

Improved Approximation Algorithms for Relay Placement

ESA '08 Proceedings of the 16th annual European symposium on Algorithms

Algorithms for connected set cover problem and fault-tolerant connected set cover problem

Theoretical Computer Science

A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications

Wireless network design via 3-decompositions

Information Processing Letters

New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs

Theoretical Computer Science

Relay placement for fault tolerance in wireless networks in higher dimensions

Computational Geometry: Theory and Applications

Survey: A survey on relay placement with runtime and approximation guarantees

Computer Science Review

A flow-based optimization model for throughput-oriented relay node placement in wireless sensor networks

Proceedings of the 28th Annual ACM Symposium on Applied Computing

Survey Topology management techniques for tolerating node failures in wireless sensor networks: A survey

Computer Networks: The International Journal of Computer and Telecommunications Networking