Capacitated Domination: Constant Factor Approximations for Planar Graphs

We consider the capacitated domination problem, which models a service-requirement assigning scenario and which is also a generalization of the dominating set problem. In this problem, we are given a graph with three parameters defined on the vertex set, which are cost, capacity, and demand. The objective of this problem is to compute a demand assignment of least cost, such that the demand of each vertex is fully-assigned to some of its closed neighbours without exceeding the amount of capacity they provide. In this paper, we provide the first constant factor approximation for this problem on planar graphs, based on a new perspective on the hierarchical structure of outer-planar graphs. We believe that this new perspective and technique can be applied to other capacitated covering problems to help tackle vertices of large degrees.

[1]  David P. Williamson,et al.  Improved approximation algorithms for capacitated facility location problems , 1999, IPCO.

[2]  Rajiv Gandhi,et al.  Dependent rounding in bipartite graphs , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[3]  Dorit S. Hochbaum,et al.  Approximation Algorithms for the Set Covering and Vertex Cover Problems , 1982, SIAM J. Comput..

[4]  D. T. Lee,et al.  Capacitated Domination Problem , 2007, Algorithmica.

[5]  Prosenjit Bose,et al.  On Embedding an Outer-Planar Graph in a Point Set , 1997, GD.

[6]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[7]  Brenda S. Baker,et al.  Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[8]  Éva Tardos,et al.  Approximation algorithms for facility location problems (extended abstract) , 1997, STOC '97.

[9]  Marcin Pilipczuk,et al.  Capacitated domination faster than O(n2) , 2011, Inf. Process. Lett..

[10]  Rajiv Gandhi,et al.  An improved approximation algorithm for vertex cover with hard capacities , 2003, J. Comput. Syst. Sci..

[11]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[12]  Shi Ying,et al.  Frontiers in Algorithmics , 2010, Lecture Notes in Computer Science.

[13]  Samir Khuller,et al.  Capacitated vertex covering , 2003, J. Algorithms.

[14]  Joseph Naor,et al.  Covering problems with hard capacities , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[15]  Mong-Jen Kao,et al.  Approximation Algorithms for the Capacitated Domination Problem , 2010, FAW.

[16]  Michael A. Langston,et al.  Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings , 2006, IWPEC.

[17]  Saket Saurabh,et al.  Capacitated Domination and Covering: A Parameterized Perspective , 2008, IWPEC.

[18]  Marcin Pilipczuk,et al.  Capacitated Domination Faster Than O(2n) , 2010, SWAT.