Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 2011: Algorithms and Computation pp 494–503Cite as

Capacitated Domination: Constant Factor Approximations for Planar Graphs

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7074))

Abstract

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.

Supported in part by the National Science Council, Taiwan, under Grants NSC99-2911-I-002-055-2, NSC98-2221-E-001-007-MY3, and NSC98-2221-E-001-008-MY3.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baker, B.S.: Approximation algorithms for np-complete problems on planar graphs. J. ACM 41, 153–180 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bose, P.: On embedding an outer-planar graph in a point set. CGTA: Computational Geometry: Theory and Applications 23, 2002 (1997)

    MathSciNet  Google Scholar 

  3. Chudak, F.A., Williamson, D.P.: Improved approximation algorithms for capacitated facility location problems. Math. Program. 102, 207–222 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chuzhoy, J.: Covering problems with hard capacities. SIAM J. Comput. 36, 498–515 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  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_8

    Google Scholar 

  6. Dom, M., Lokshtanov, D., Saurabh, S., Villanger, Y.: Capacitated Domination and Covering: A Parameterized Perspective. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol. 5018, pp. 78–90. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  7. 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)

    Article  MathSciNet  MATH  Google Scholar 

  8. Gandhi, R., Khuller, S., Parthasarathy, S., Srinivasan, A.: Dependent rounding in bipartite graphs. In: FOCS 2002, pp. 323–332 (2002)

    Google Scholar 

  9. Guha, S., Hassin, R., Khuller, S., Or, E.: Capacitated vertex covering. J. Algorithms 48(1), 257–270 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  10. Hochbaum, D.: Approximation algorithms for the set covering and vertex cover problems. SIAM Journal on Computing 11, 555–556 (1982)

    Article  MathSciNet  MATH  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 

  12. Kao, M.-J., Chen, H.-L.: Approximation Algorithms for the Capacitated Domination Problem. In: Lee, D.-T., Chen, D.Z., Ying, S. (eds.) FAW 2010. LNCS, vol. 6213, pp. 185–196. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  13. Kao, M.-J., Lee, D.: Capacitated domination: Constant factor approximation for planar graphs (manuscript, 2011), http://arxiv.org/abs/1108.4606

  14. Kao, M.-J., Liao, C.-S., Lee, D.T.: Capacitated domination problem. Algorithmica 60, 274–300 (2011), doi:10.1007/s00453-009-9336-x

    Article  MathSciNet  MATH  Google Scholar 

  15. Liedloff, M., Todinca, I., Villanger, Y.: Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol. 6410, pp. 88–99. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan

    Mong-Jen Kao & D. T. Lee

Authors
  1. Mong-Jen Kao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. T. Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Chuo University, Kasuga, Bunkyo-ku, 112-8551, Tokyo, Japan

    Takao Asano

  2. Gunma University, 1-5-1 Tenjin-Cho, 376-8515, Kiryu-Shi, Japan

    Shin-ichi Nakano

  3. Japan Advanced Institute of Science and Technology, 1-1 Asahidai, 923-1292, Nomi, Ishikawa, Japan

    Yoshio Okamoto

  4. Tokyo Institute of Technology, 2-12-1 Ookayama, Meguro-ku, 152-8552, Tokyo, Japan

    Osamu Watanabe

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kao, MJ., Lee, D.T. (2011). Capacitated Domination: Constant Factor Approximations for Planar Graphs. In: Asano, T., Nakano, Si., Okamoto, Y., Watanabe, O. (eds) Algorithms and Computation. ISAAC 2011. Lecture Notes in Computer Science, vol 7074. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25591-5_51

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25591-5_51

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25590-8

  • Online ISBN: 978-3-642-25591-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation