IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v23y2012i4d10.1007_s10878-010-9357-z.html
   My bibliography  Save this article

A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs

Author

Listed:
  • Xu Zhu

    (Xi’an Jiaotong University)

  • Wei Wang

    (Xi’an Jiaotong University)

  • Shan Shan

    (The University of Texas at Dallas)

  • Zhong Wang

    (The University of Texas at Dallas)

  • Weili Wu

    (The University of Texas at Dallas)

Abstract

In the minimum weighted dominating set problem (MWDS), we are given a unit disk graph with non-negative weight on each vertex. The MWDS seeks a subset of the vertices of the graph with minimum total weight such that each vertex of the graph is either in the subset or adjacent to some nodes in the subset. A weight function is called smooth, if the ratio of the weights of any two adjacent nodes is upper bounded by a constant. MWDS is known to be NP-hard. In this paper, we give the first polynomial time approximation scheme (PTAS) for MWDS with smooth weights on unit disk graphs, which achieves a (1+ε)-approximation for MWDS, for any ε>0.

Suggested Citation

  • Xu Zhu & Wei Wang & Shan Shan & Zhong Wang & Weili Wu, 2012. "A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs," Journal of Combinatorial Optimization, Springer, vol. 23(4), pages 443-450, May.
    • Handle: RePEc:spr:jcomop:v:23:y:2012:i:4:d:10.1007_s10878-010-9357-z
    DOI: 10.1007/s10878-010-9357-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-010-9357-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-010-9357-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    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:jcomop:v:23:y:2012:i:4:d:10.1007_s10878-010-9357-z. See general information about how to correct material in RePEc.

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

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.