Abstract
The Capacitated Dominating Set problem is the problem of finding a dominating set of minimum cardinality where each vertex has been assigned a bound on the number of vertices it has capacity to dominate. Cygan et al. showed in 2009 that this problem can be solved in \(O(n^3 m {{n} \choose {n/3}})\) or in O *(1.89n) time using maximum matching algorithm. An alternative way to solve this problem is to use dynamic programming over subsets. By exploiting structural properties of instances that can not be solved fast by the maximum matching approach, and “hiding” additional cost related to considering subsets of large cardinality in the dynamic programming, an improved algorithm is obtained. We show that the Capacitated Dominating Set problem can be solved in O *(1.8463n) time.
This work has been supported by ANR Blanc AGAPE (ANR-09-BLAN-0159-03) and EGIDE Aurora (18809RM).
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Alber, J., Bodlaender, H.L., Fernau, H., Kloks, T., Niedermeier, R.: Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica 33(4), 461–493 (2002)
Bodlaender, H.L., Lokshtanov, D., Penninkx, E.: Planar capacitated dominating set is W[1]-Hard. In: Chen and Fomin [3], pp. 50–60
Chen, J., Fomin, F.V. (eds.): 4th International Workshop on Parameterized and Exact Computation, IWPEC 2009, Copenhagen, Denmark, Revised Selected Papers, September 10-11. LNCS, vol. 5917. Springer, Heidelberg (2009)
Cygan, M., Pilipczuk, M., Wojtaszczyk, J.O.: Capacitated domination faster than O(2n). In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol. 6139, pp. 74–80. Springer, Heidelberg (2010)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
Fomin, F.V., Grandoni, F., Kratsch, D.: Solving connected dominating set faster than 2n. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 152–163. Springer, Heidelberg (2006)
Fomin, F.V., Iwama, K., Kratsch, D., Kaski, P., Koivisto, M., Kowalik, L., Okamoto, Y., van Rooij, J., Williams, R.: 08431 open problems moderately exponential time algorithms. In: Fomin, F.V., Iwama, K., Kratsch, D. (eds.) Moderately Exponential Time Algorithms. No. 08431 in Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, Dagstuhl, Germany (2008), http://drops.dagstuhl.de/opus/volltexte/2008/1798
Fomin, F.V., Kratsch, D., Woeginger, G.J.: Exact (exponential) algorithms for the dominating set problem. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 245–256. Springer, Heidelberg (2004)
Koivisto, M.: Partitioning into sets of bounded cardinality. In: Chen and Fomin [3], pp. 258–263
van Rooij, J.M.M., Nederlof, J., van Dijk, T.C.: Inclusion/exclusion meets measure and conquer. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 554–565. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liedloff, M., Todinca, I., Villanger, Y. (2010). Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching. In: Thilikos, D.M. (eds) Graph Theoretic Concepts in Computer Science. WG 2010. Lecture Notes in Computer Science, vol 6410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16926-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-16926-7_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16925-0
Online ISBN: 978-3-642-16926-7
eBook Packages: Computer ScienceComputer Science (R0)