References
- Meguerdichian S, Koushanfar F, Potkonjak M, Srivastava M. Coverage problem in wireless ad-hoc sensor networks. In: Proceeding of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM); April 22–26; Anchorage (AK): IEEE Xplore; 2001. p. 1380–1387.
- Cardei M, MacCallum D, Cheng X, Min M, Jia X, Li D, Du D-Z. Wireless sensor networks with energy efficient organization. J. Inter. Netw. 2002;3:213–229.
- Cardei M, Du D-Z. Improving wireless sensor network lifetime through power aware organization. ACM Wirel. Netw. 2005;11:333–340.
- Cardei M, Thai M, Li Y, Wu W. Energy-efficient target coverage in wireless sensor networks. In:Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM); 2005 March 13–17; Miami: IEEE Computer Society; 2005.
- Berman P, Calinescu G, Shah C, Zelikovsky A. Power efficient monitoring management in sensor networks. In: IEEE Wireless Communication and Networking Conference (WCNC’04). Atlanta; 2004. p. 2329–2334.
- Garg N, Könemann J. Faster and simpler algorithms for multicommodity flows and other fractional packing problems. In: Proceedings of the 39th Annual Symposium on the Foundations of Computer, Science (FOCS’98); 1998 November 8–11; Palo Alto (CA): IEEE Computer Society; 1998. p. 300–309.
- Ding L, Wu W, Willson JK, Wu L, Lu Z, Lee W. Constant-approximation for target coverage problem in wireless sensor networks. In: Proceedings of the 31st Annual Joint Conference of IEEE Communication and Computer Society (INFOCOM); 2012 March 25–30; Orlando (FL): IEEE Computer Society; 2012.
- Huang Y, Gao X, Zhang Z, Wu W. A better constant-factor approximation for weighted dominating set in unit disk graph. J. Comb. Optim. 2009;18:174–194.
- Du D-Z, Ko K-I, Hu X. Design and analysis of approximation algorithms. New York (NY): Springer; 2012. p. 142–157.
- Ambühl C, Erlebach T, Mihalák M, Nunkesser M. Constant-approximation for minimum-weight (connected) dominating sets in unit disk graphs. In: Proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX 2006); 2006 August 28–30; Barcelona: Springer; 2006. p. 3–14.
- Dai D, Changyuan Yu. A (5 + ϵ)-approximation algorithm for minimum weighted dominating set in unit disk graph. Theor. Comput. Sci. 2009;410:756–765.
- Erlebach T, Mihalák M. A (4 + ϵ)-approximation for the minimum-weight dominating set problem in unit disk graphs. In: Proceedings of the 7th Workshop on Approximation and Online Algorithms (WAOA); September 10–11; Copenhagen; 2009. p. 135–146.
- Zou F, Wang Y, Xiaohua X, Hongwei D, Li X, Wan P, Weili W. New approximations for weighted dominating sets and connected dominating sets in unit disk graphs. Theor. Comput. Sci. 2011;412:198–208.