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.
KeywordsPlanar Graph Closed Neighbour Facility Location Problem Outerplanar Graph Vertex Cover Problem
Unable to display preview. Download preview PDF.
- 5.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), doi:10.1007/978-3-642-13731-0_8Google Scholar
- 8.Gandhi, R., Khuller, S., Parthasarathy, S., Srinivasan, A.: Dependent rounding in bipartite graphs. In: FOCS 2002, pp. 323–332 (2002)Google Scholar
- 11.Johnson, D.S.: Approximation algorithms for combinatorial problems. In: The 5th Annual ACM Symposium on Theory of Computing, pp. 38–49 (1973)Google Scholar
- 13.Kao, M.-J., Lee, D.: Capacitated domination: Constant factor approximation for planar graphs (manuscript, 2011), http://arxiv.org/abs/1108.4606
- 16.Shmoys, D.B., Tardos, E., Aardal, K.: Approximation algorithms for facility location problems (extended abstract). In: STOC 1997, pp. 265–274 (1997)Google Scholar