IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v37y2025i4p1106-1120.html
   My bibliography  Save this article

A New Approximation Algorithm for Minimum-Weight ( 1 , m ) –Connected Dominating Set

Author

Listed:
  • Jiao Zhou

    (School of Mathematical Sciences, Zhejiang Normal University, Jinhua, Zhejiang 321004, China)

  • Yingli Ran

    (School of Mathematical Sciences, Zhejiang Normal University, Jinhua, Zhejiang 321004, China)

  • Panos M. Pardalos

    (Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida 32611)

  • Zhao Zhang

    (School of Mathematical Sciences, Zhejiang Normal University, Jinhua, Zhejiang 321004, China)

  • Shaojie Tang

    (Department of Management Science and Systems, University at Buffalo, Buffalo, New York 14260)

  • Ding-Zhu Du

    (Department of Computer Science, University of Texas at Dallas, Richardson, Texas 75080)

Abstract

Consider a graph with nonnegative node weight. A vertex subset is called a CDS (connected dominating set) if every other node has at least one neighbor in the subset and the subset induces a connected subgraph. Furthermore, if every other node has at least m neighbors in the subset, then the node subset is called a ( 1 , m ) CDS. The minimum-weight ( 1 , m ) CDS problem aims at finding a ( 1 , m ) CDS with minimum total node weight. In this paper, we present a new polynomial-time approximation algorithm for this problem, which improves previous ratio by a factor of 2/3.

Suggested Citation

  • Jiao Zhou & Yingli Ran & Panos M. Pardalos & Zhao Zhang & Shaojie Tang & Ding-Zhu Du, 2025. "A New Approximation Algorithm for Minimum-Weight ( 1 , m ) –Connected Dominating Set," INFORMS Journal on Computing, INFORMS, vol. 37(4), pages 1106-1120, July.
    • Handle: RePEc:inm:orijoc:v:37:y:2025:i:4:p:1106-1120
    DOI: 10.1287/ijoc.2023.0306
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/ijoc.2023.0306
    Download Restriction: no
    File URL: https://libkey.io/10.1287/ijoc.2023.0306?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
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:inm:orijoc:v:37:y:2025:i:4:p:1106-1120. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.