# PTAS for the minimum weighted dominating set in growth bounded graphs

## Author

Listed:
• Zhong Wang

()

• Wei Wang

()

• Joon-Mo Kim

()

• Bhavani Thuraisingham

()

• Weili Wu

()

## 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. Copyright Springer Science+Business Media, LLC. 2012

## Suggested Citation

• Zhong Wang & Wei Wang & Joon-Mo Kim & Bhavani Thuraisingham & Weili Wu, 2012. "PTAS for the minimum weighted dominating set in growth bounded graphs," Journal of Global Optimization, Springer, vol. 54(3), pages 641-648, November.
• Handle: RePEc:spr:jglopt:v:54:y:2012:i:3:p:641-648
DOI: 10.1007/s10898-011-9795-x
as

File URL: http://hdl.handle.net/10.1007/s10898-011-9795-x

As the access to this document is restricted, you may want to search for a different version of it.

### Keywords

Approximation algorithm; Graph theory; PTAS; Dominating set;

## Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:54:y:2012:i:3:p:641-648. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

We have no references for this item. You can help adding them by using this form .

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.