Skip to main content
SpringerLink
Log in

PTAS for the minimum weighted dominating set in growth bounded graphs

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

The minimum weighted dominating set (MWDS) problem is one of the classic NP-hard optimization problems in graph theory with applications in many fields such as wireless communication networks. MWDS in general graphs has been showed not to have polynomial-time constant-approximation if \({\mathcal{NP} \neq \mathcal{P}}\) . Recently, several polynomial-time constant-approximation SCHEMES have been designed for MWDS in unit disk graphs. In this paper, using the local neighborhood-based scheme technique, we present a PTAS for MWDS in polynomial growth bounded graphs with bounded degree constraint.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ambuehl, C., Erlebach, T., Mihalak, M., Nunkesser, M.: Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. In: Proceedings of the 9th Workshop on Approximation Algorithms for Combinatorial Optimization Problems. LNCS 4110, Springer, pp. 3–14 (2006)

  2. Alon N., Moshkovitz D., Safra M.: Algorithmic construction of sets for k-restrictions. ACM Trans. Algorithms (TALG) 2(2), 153–177 (2006)

    Article  Google Scholar 

  3. Baker B.S.: Approximation algorithms for NP-complete problems on planar graphs. JACM 41(1), 153–180 (1994)

    Article  Google Scholar 

  4. Breu H., Kirkpatrick D.G.: Unit disk graph recognition is NP-hard. Comput. Geom.: Theory Appl. 9(1–2), 3–24 (1998)

    Article  Google Scholar 

  5. Clark B.N., Colbourn C.J., Johnson D.S.: Unit disk graphs. Discret. Math. 86(1–3), 165–177 (1990)

    Article  Google Scholar 

  6. Cheng X., Huang X., Li D., Wu W., Du D.-Z.: A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks. Networks 42, 202–208 (2003)

    Article  Google Scholar 

  7. Dai D., Yu C.: A 5+ epsilon-approximation algorithm for minimum weighted dominating set in unit disk graph. Theor. Comput. Sci. 410(8–10), 756–765 (2009)

    Article  Google Scholar 

  8. Erlebach T., Jansen K., Seidel E.: Polynomial-time approximation schemes for geometric intersection graphs. SIAM J. Comput. 34(6), 1302–1323 (2005)

    Article  Google Scholar 

  9. Gao, X., Huang, Y., Zhang, Z., Wu, W.: \({(6 + \varepsilon)}\) -approximation for minimum weight dominating set in unit disk graphs. COCOON, pp. 551–557 (2008)

  10. Li X.: Algorithmic, geometric and graphs issues in wireless networks. Wirel. Commun. Mobile Comput. 3, 119–140 (2003)

    Article  Google Scholar 

  11. Nieberg T., Hurink J., Kern W.: Approximation schemes for wireless networks. ACM Trans. Algorithms 4(4), 1–17 (2008)

    Article  Google Scholar 

  12. Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on theory of Computing (El Paso, Texas, United States, May 04–06, 1997). STOC ’97. ACM, New York, NY, pp. 475–484 (1997)

  13. Vol’berg A.L., Konyagin S.V.: On measures with the doubling condition. Math. USSR Izvestiya 30, 629–638 (1988)

    Article  Google Scholar 

  14. Wu J.: Hausdoff dimension and doubling measures on metric spaces. Proc. Am. Math. Soc. 126(5), 1453–1459 (1998)

    Article  Google Scholar 

  15. Wang, Y., Wang, W., Li, X.: Distributed low-cost backbone formation for wireless ad hoc networks. In: Proceedings of the 6th ACM international Symposium on Mobile Ad Hoc Networking and Computing (Urbana-Champaign, IL, USA, May 25–27, 2005). MobiHoc ’05. ACM, New York, NY, pp. 2–13 (2005)

  16. Zou, F., Wang, Y., Li, X., Xu, X., Du, H., Wan, P., Wu, W.: New Approximations for Minimum-Weighted Dominating Set and Minimum-Weighted Connected Dominating Set on Unit Disk Graphs, to appear in Theoretical Computer Science

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Texas at Dallas, Richardson, TX, 75083, USA

    Zhong Wang, Bhavani Thuraisingham & Weili Wu

  2. Department of Mathematics, Xi’an Jiaotong University, Xi’an, 710049, People’s Republic of China

    Wei Wang

  3. Dankook University, Seoul, Korea

    Joon-Mo Kim

Authors
  1. Zhong Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wei Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Joon-Mo Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bhavani Thuraisingham
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Weili Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhong Wang.

Additional information

This work is supported in part by National Science Foundation under grants CCF 0621829 and 0627233.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, Z., Wang, W., Kim, JM. et al. PTAS for the minimum weighted dominating set in growth bounded graphs. J Glob Optim 54, 641–648 (2012). https://doi.org/10.1007/s10898-011-9795-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-011-9795-x

Keywords

Search

Navigation