Abstract
We consider a local service-requirement assignment problem named capacitated domination from an algorithmic point of view. In this problem, we are given a graph with three parameters defined on each vertex, which are the cost, the capacity, and the demand, of a vertex, respectively. A vertex can be chosen multiple times in order to generate sufficient capacity for the demands of the vertices in its closed neighborhood. The objective of this problem is to compute a demand assignment of minimum cost such that the demand of each vertex is fully-served by some of its closed neighbors without exceeding the amount of capacity they provide.
In this paper, we provide complexity results as well as several approximation algorithms to compose a comprehensive study for this problem. First, we provide logarithmic approximations for general graphs which are asymptotically optimal. From the perspective of parameterized complexity, we show that this problem is W[1]-hard with respect to treewidth and solution size. Moreover, we show that this problem is fixed-parameter tractable with respect to treewidth and the maximum capacity of the vertices. The latter result implies a pseudo-polynomial time approximation scheme for planar graphs under a standard framework.
In order to drop the pseudo-polynomial factor, we develop a constant-factor approximation for planar graphs, based on a new perspective which we call general ladders on the hierarchical structure of outer-planar graphs. We believe that the approach we use can be applicable to other capacitated covering problems.












Similar content being viewed by others
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, 461–493 (2002)
Alber, J., Fellows, M.R., Niedermeier, R.: Polynomial-time data reduction for dominating set. J. ACM 51, 363–384 (2004)
Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41, 153–180 (1994)
Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing (STOC’93), pp. 226–234. ACM, New York (1993)
Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209, 1–45 (1998)
Bodlaender, H.L., Koster, A.M.C.A.: Combinatorial optimization on graphs of bounded treewidth. Comput. J. 51, 255–269 (2008)
Bose, P.: On embedding an outer-planar graph in a point set. Comput. Geom. Theory Appl. 23, 303–312 (2002)
Chen, J., Fernau, H., Kanj, I.A., Xia, G.: Parametric duality and kernelization: lower bounds and upper bounds on kernel size. SIAM J. Comput. 37, 1077–1106 (2007)
Chudak, F.A., Williamson, D.P.: Improved approximation algorithms for capacitated facility location problems. Math. Program. 102, 207–222 (2005)
Chuzhoy, J.: Covering problems with hard capacities. SIAM J. Comput. 36, 498–515 (2006)
Cygan, M., Pilipczuk, M., Wojtaszczyk, J.O.: Capacitated domination faster than O(2n). In: Proceedings of the 12th Scandinavian Conference on Algorithm Theory (SWAT’10), pp. 74–80. Springer, Berlin (2010)
Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Subexponential parameterized algorithms on bounded-genus graphs and h-minor-free graphs. J. ACM 52, 866–893 (2005)
Dom, M., Lokshtanov, D., Saurabh, S., Villanger, Y.: Capacitated domination and covering: a parameterized perspective. In: Proceedings of the 3rd International Conference on Parameterized and Exact Computation (IWPEC’08), pp. 78–90. Springer, Heidelberg (2008)
Downey, R.G., Fellows, M.: Parameterized Complexity. Springer, Berlin (1999)
Feige, U.: A threshold of lnn for approximating set cover. J. ACM 45, 634–652 (1998)
Fellows, M.R., Fomin, F.V., Lokshtanov, D., Rosamond, F., Saurabh, S., Szeider, S., Thomassen, C.: On the complexity of some colorful problems parameterized by treewidth. Inf. Comput. 209, 143–153 (2011)
Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)
Fomin, F.V., Thilikos, D.M.: Dominating sets in planar graphs: branch-width and exponential speed-up. SIAM J. Comput. 36, 281–309 (2006)
Gandhi, R., Halperin, E., Khuller, S., Kortsarz, G., Srinivasan, A.: An improved approximation algorithm for vertex cover with hard capacities. J. Comput. Syst. Sci. 72, 16–33 (2006)
Gandhi, R., Khuller, S., Parthasarathy, S., Srinivasan, A.: Dependent rounding in bipartite graphs. In: Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS’02), pp. 323–332. IEEE Comput. Soc., Washington (2002)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
Guha, S., Hassin, R., Khuller, S., Or, E.: Capacitated vertex covering. J. Algorithms 48, 257–270 (2003)
Guo, J., Niedermeier, R.: Linear problem kernels for NP-hard problems on planar graphs. In: Proceedings of the 34th International Conference on Automata, Languages and Programming (ICALP’07), pp. 375–386. Springer, Berlin (2007)
Hagerup, T.: Simpler linear-time kernelization for planar dominating set. In: Proceedings of the 6th International Conference on Parameterized and Exact Computation (IPEC’11), pp. 181–193. Springer, Berlin (2012)
Haynes, T.W., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs (Pure and Applied Mathematics). Dekker, New York (1998)
Haynes, T.W., Hedetniemi, S.M., Hedetniemi, S.T., Henning, M.A.: Domination in graphs applied to electric power networks. SIAM J. Discrete Math. 15, 519–529 (2002)
Hochbaum, D.S.: Approximation algorithms for the set covering and vertex cover problems. SIAM J. Comput. 11, 555–556 (1982)
Hopcroft, J., Tarjan, R.: Efficient planarity testing. J. ACM 21, 549–568 (1974)
Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9, 256–278 (1974)
Kammer, F., Tholey, T.: Approximate tree decompositions of planar graphs in linear time. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’12), pp. 683–698. SIAM, Philadelphia (2012)
Kao, M.-J., Chen, H.-L.: Approximation algorithms for the capacitated domination problem. In: FAW 2010, pp. 185–196. Springer, Berlin (2010)
Kao, M.-J., Lee, D.T.: Capacitated domination: constant factor approximations for planar graphs. In: Proceedings of the 22nd International Conference on Algorithms and Computation (ISAAC’11), pp. 494–503. Springer, Berlin (2011)
Kao, M.-J., Liao, C.-S., Lee, D.T.: Capacitated domination problem. Algorithmica 60, 274–300 (2011)
Kloks, T.: Treewidth, Computations and Approximations. Lecture Notes in Computer Science, vol. 842. Springer, Berlin (1994)
Liao, C.-S., Lee, D.-T.: Power domination problem in graphs. In: Proceedings of the 11th Annual International Conference on Computing and Combinatorics (COCOON’05), pp. 818–828. Springer, Berlin (2005)
Liedloff, M., Todinca, I., Villanger, Y.: Solving capacitated dominating set by using covering by subsets and maximum matching. Discrete Appl. Math. (2012)
Niedermeier, R.: Invitation to Fixed Parameter Algorithms. Oxford University Press, Oxford (2006)
Pál, M., Tardos, E., Wexler, T.: Facility location with nonuniform hard capacities. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS’01), p. 329. IEEE Comput. Soc., Washington (2001)
Roberts, F.S.: Graph Theory and Its Applications to Problems of Society (1978)
Shmoys, D.B., Tardos, E., Aardal, K.: Approximation algorithms for facility location problems (extended abstract). In: STOC 1997, pp. 265–274. ACM, New York (1997)
van Bevern, R., Hartung, S., Kammer, F., Niedermeier, R., Weller, M.: Linear-time computation of a linear problem kernel for dominating set on planar graphs. In: Proceedings of the 6th International Conference on Parameterized and Exact Computation (IPEC’11), pp. 194–206. Springer, Berlin (2012)
Vazirani, V.V.: Approximation Algorithms. Springer, New York (2001)
Wan, P.-J., Alzoubi, K.M., Frieder, O.: A simple heuristic for minimum connected dominating set in graphs. Int. J. Found. Comput. Sci. 14, 323–333 (2003)
Acknowledgements
The authors would like to thank the anonymous referees for their very helpful comments on the presentation of this work.
This work was supported in part by the National Science Council, Taipei 10622, Taiwan, under Grants NSC98-2221-E-001-007-MY3, NSC98-2221-E-001-008-MY3, NSC99-2911-I-002-055-2, NSC101-2221-E-005-026-MY2, and NSC101-2221-E-005-019-MY2.
Author information
Authors and Affiliations
Corresponding author
Additional information
Extended abstracts of this work appeared in the 4th Frontiers of Algorithmics Workshop (FAW’10), Wuhan, China (received the best student paper award) [31] and the 22nd International Symposium on Algorithms and Computation (ISAAC’11), Yokohama, Japan [32].
Part of this work was done when the author M.-J. Kao was with Karlsruhe Institute of Technology (KIT), Germany, as a visiting student.
Rights and permissions
About this article
Cite this article
Kao, MJ., Chen, HL. & Lee, D.T. Capacitated Domination: Problem Complexity and Approximation Algorithms. Algorithmica 72, 1–43 (2015). https://doi.org/10.1007/s00453-013-9844-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-013-9844-6