Approximation algorithms for domatic partitions of unit disk graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5687 LNCS, Issue , 2009, Pages 312-325

  Pandit, Saurav ^a   Pemmaraju, Sriram V ^a   Varadarajan, Kasturi ^a  

^a University of Iowa   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BEST APPROXIMATIONS; CONSTANT FACTOR APPROXIMATION; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; DISTRIBUTED APPROXIMATION ALGORITHM; DISTRIBUTED COMPUTING; DISTRIBUTED IMPLEMENTATION; DOMATIC PARTITION; GENERAL GRAPH; LOCAL MODEL; MINIMUM DOMINATING SET; OPTIMIZATION PROBLEMS; UNIT DISK GRAPHS;

COMBINATORIAL OPTIMIZATION; DISKS (STRUCTURAL COMPONENTS); DISTRIBUTED COMPUTER SYSTEMS; ENERGY CONSERVATION; TECHNICAL PRESENTATIONS; WIRELESS TELECOMMUNICATION SYSTEMS;

APPROXIMATION ALGORITHMS;

EID: 70350600106     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03685-9_24     Document Type: Conference Paper

References (15)

1. Aloupis, G., Cardinal, J., Collette, S., Langerman, S., Orden, D., Ramos, P.: Decomposition of multiple coverings into more parts. In: Proceedings of SODA (2009)
2. Ambühl, C., Erlebach, T., Mihalák, M., Nunkesser, M.: Constant-factor approximation for minimum-weight (Connected) dominating sets in unit disk graphs. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX-RANDOM 2006. LNCS, vol. 4110, pp. 3-14. Springer, Heidelberg (2006)
3. Bartal, Y., Byers, J.W., Raz, D.: Global optimization using local information with applications to flow control. In: FOCS 1997: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, Washington, DC, USA, 1997, p. 303. IEEE Computer Society Press, Los Alamitos (1997)
4. Berman, P., Calinescu, G., Shah, C., Zelikovsky, A.: Power efficient monitoring management in sensor networks. In: Wireless Communications and Networking Conference (WCNC), vol. 4, pp. 21-24 (2004)
5. Calinescu, G., Kapoor, S., Olshevsky, A., Zelikovsky, A.: Network lifetime and power assignment in ad hoc wireless networks. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 114-126. Springer, Heidelberg (2003)
6. Cardei, M., Thai, M.T., Li, Y., Wu, W.: Energy-efficient target coverage in wireless sensor networks. In: INFOCOM, pp. 1976-1984 (2005)
7. Cǎlinescu, G., Mǎndoiu, I., Wan, P., Zelikovsky, A.: Selecting forwarding neighbors in wireless ad hoc networks. Mobile Networks and Applications 9, 101-111 (2004)
8. Feige, U., Halldorsson, M.M., Kortsarz, G., Srinivasan, A.: Approximating the domatic number. SIAM J. Comput. 32(1), 172-195 (2002)
9. Huang, Y., Gao, X., Zhang, Z., Wu,W.: A better constant-factor approximation for weighted dominating set in unit disk graph. Journal of Combinatorial Optimization (2008)
10. Kuhn, F., Moscibroda, T., Wattenhofer, R.: The price of being near-sighted. In: SODA 2006: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pp. 980-989. ACM Press, New York (2006)
11. Moscibroda, T., Wattenhofer, R.: Maximizing the lifetime of dominating sets. In: Proceedings of the 5th. IEEE International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (2005)
12. Pach, J., Tóth, G.: Decomposition of multiple coverings into many parts. In: Proc. 23rd ACM Symp. on Computational Geometry, pp. 133-137 (2007)
13. Pandit, S., Pemmaraju, S.: Finding facilities fast. In: Proceedings of the 10th International Conference on Distributed Computing and Networks (January 2009)
14. Peleg, D.: Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics (2000)
15. Pemmaraju, S.V., Pirwani, I.A.: Energy conservation via domatic partitions. In: MobiHoc, pp. 143-154 (2006)