Abstract
The Minimum Capacitated Dominating Set (CAPMDS) problem is the problem of finding a dominating set of minimum cardinality with the additional constraint that the nodes dominated do not exceed the capacity of the dominating node. The capacity can be uniform across all nodes or variable. Being a generalization of the Minimum Dominating Set problem, this problem also \(\cal NP\)-hard. In this paper, we present a heuristic and a couple of its variants for solving the CAPMDS problem. Our heuristics work for both uniform and variable capacity graphs. We show that the heuristic proposed is better than the variants, in general. However, for Unit Disk Graphs with high degree of connectivity and uniform capacity, one of the variants performs better. For general graphs, the proposed heuristic is far superior to the variants.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bar-Ilan, J., Kortsarz, G., Peleg, D.: How to allocate network centers. Journal of Algorithms 15, 385–415 (1993)
Garey, M., Johnson, D.: Computers and tractability, a guide to the theory of np-completeness (1979)
Nieberg, T., Hurink, J.L.: A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol. 3879, pp. 296–306. Springer, Heidelberg (2006)
Schneider, J., Wattenhofer, R.: A log-star distributed maximal independent set algorithm for growth-bounded graphs. In: Proceedings of the Twenty-Seventh ACM Symposium on Principles of Distributed Computing, PODC 2008, pp. 35–44 (2008)
Kuhn, F., Moscibroda, T.: Distributed approximation of capacitated dominating sets. In: Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2007, pp. 161–170 (2007)
Wattenhoffer, R. (Distributed dominating set approximation), http://www.disco.ethz.ch/lectures/ss04/distcomp/lecture/chapter12.pdf
Mastrogiovanni, M.: The clustering simulation framework: A simple manual (2007), http://www.michele-mastrogiovanni.net/software/download/README.pdf
Jovanovic, R., Tuba, M., Simian, D.: Ant colony optimization applied to minimum weight dominating set problem. In: Proceedings of the 12th WSEAS International Conference on Automatic Control, Modelling and Simulation (ACMOS 2010), pp. 322–326 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Potluri, A., Singh, A. (2012). A Greedy Heuristic and Its Variants for Minimum Capacitated Dominating Set. In: Parashar, M., Kaushik, D., Rana, O.F., Samtaney, R., Yang, Y., Zomaya, A. (eds) Contemporary Computing. IC3 2012. Communications in Computer and Information Science, vol 306. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32129-0_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-32129-0_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32128-3
Online ISBN: 978-3-642-32129-0
eBook Packages: Computer ScienceComputer Science (R0)