We prove a new structural property regarding the “skyline” of uniform radius disks and use this to derive a number of new sequential and distributed approximation algorithms for well-known optimization problems on unit disk graphs (UDGs). Specifically, the paper presents new approximation algorithms for two problems: domatic partition and weighted minimum dominating set (WMDS) on UDGs, both of which are of significant interest to the distributed computing community because of applications to energy conservation in wireless networks. Using the aforementioned skyline property, we derive the first constant-factor approximation algorithm for the domatic partition problem on UDGs. Prior to our work, the best approximation factor for this problem was O(logn), obtained by simply using the approximation algorithm for general graphs. From the domatic partition algorithm, we derive a new and simpler constant-factor approximation for WMDS on UDGs. Because of “locality” properties that our algorithms possess, both algorithms have relatively simple constant-round distributed implementations in the \(\mathcal{LOCAL}\) model, where there is no bound on the message size. In addition, we obtain O(log2 n)-round distributed implementations of these algorithms in the \(\mathcal{CONGEST}\) model, where message sizes are bounded above by O(logn) bits per message.


Approximation Algorithm Message Size Unit Disk Graph Bottom Node Disk Cover 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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)Google Scholar
  2. 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)CrossRefGoogle Scholar
  3. 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)CrossRefGoogle Scholar
  4. 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)Google Scholar
  5. 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)CrossRefGoogle Scholar
  6. 6.
    Cardei, M., Thai, M.T., Li, Y., Wu, W.: Energy-efficient target coverage in wireless sensor networks. In: INFOCOM, pp. 1976–1984 (2005)Google Scholar
  7. 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)CrossRefGoogle Scholar
  8. 8.
    Feige, U., Halldorsson, M.M., Kortsarz, G., Srinivasan, A.: Approximating the domatic number. SIAM J. Comput. 32(1), 172–195 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 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)Google Scholar
  10. 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)CrossRefGoogle Scholar
  11. 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)Google Scholar
  12. 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)Google Scholar
  13. 13.
    Pandit, S., Pemmaraju, S.: Finding facilities fast. In: Proceedings of the 10th International Conference on Distributed Computing and Networks (January 2009)Google Scholar
  14. 14.
    Peleg, D.: Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics (2000)Google Scholar
  15. 15.
    Pemmaraju, S.V., Pirwani, I.A.: Energy conservation via domatic partitions. In: MobiHoc, pp. 143–154 (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Saurav Pandit
    • 1
  • Sriram V. Pemmaraju
    • 1
  • Kasturi Varadarajan
    • 1
  1. 1.Department of Computer ScienceThe University of IowaIowa CityUSA

Personalised recommendations