IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v18y2009i4d10.1007_s10878-009-9229-6.html
   My bibliography  Save this article

Node-weighted Steiner tree approximation in unit disk graphs

Author

Listed:
  • Feng Zou

    (University of Texas at Dallas)

  • Xianyue Li

    (Lanzhou University)

  • Suogang Gao

    (Hebei Normal University)

  • Weili Wu

    (University of Texas at Dallas)

Abstract

Given a graph G=(V,E) with node weight w:V→R + and a subset S⊆V, find a minimum total weight tree interconnecting all nodes in S. This is the node-weighted Steiner tree problem which will be studied in this paper. In general, this problem is NP-hard and cannot be approximated by a polynomial time algorithm with performance ratio aln n for any 0

Suggested Citation

  • Feng Zou & Xianyue Li & Suogang Gao & Weili Wu, 2009. "Node-weighted Steiner tree approximation in unit disk graphs," Journal of Combinatorial Optimization, Springer, vol. 18(4), pages 342-349, November.
    • Handle: RePEc:spr:jcomop:v:18:y:2009:i:4:d:10.1007_s10878-009-9229-6
    DOI: 10.1007/s10878-009-9229-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-009-9229-6
    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-009-9229-6?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.

    References listed on IDEAS

    as
    1. Yaochun Huang & Xiaofeng Gao & Zhao Zhang & Weili Wu, 2009. "A better constant-factor approximation for weighted dominating set in unit disk graph," Journal of Combinatorial Optimization, Springer, vol. 18(2), pages 179-194, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Bang Ye Wu & Chen-Wan Lin, 2015. "On the clustered Steiner tree problem," Journal of Combinatorial Optimization, Springer, vol. 30(2), pages 370-386, August.
    2. Hongwei Du & Panos Pardalos & Weili Wu & Lidong Wu, 2013. "Maximum lifetime connected coverage with two active-phase sensors," Journal of Global Optimization, Springer, vol. 56(2), pages 559-568, June.
    3. Lidan Fan & Zhao Zhang & Wei Wang, 2011. "PTAS for minimum weighted connected vertex cover problem with c-local condition in unit disk graphs," Journal of Combinatorial Optimization, Springer, vol. 22(4), pages 663-673, November.
    4. Jiao Zhou & Zhao Zhang & Shaojie Tang & Xiaohui Huang & Ding-Zhu Du, 2018. "Breaking the O (ln n ) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 225-235, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hongwei Du & Panos Pardalos & Weili Wu & Lidong Wu, 2013. "Maximum lifetime connected coverage with two active-phase sensors," Journal of Global Optimization, Springer, vol. 56(2), pages 559-568, June.
    2. Xiao Zhang & Haosheng Fan & Victor C. S. Lee & Minming Li & Yingchao Zhao & Chuang Liu, 2018. "Minimizing the total cost of barrier coverage in a linear domain," Journal of Combinatorial Optimization, Springer, vol. 36(2), pages 434-457, August.
    3. Zhao Zhang & Wei Liang & Hongmin W. Du & Siwen Liu, 2022. "Constant Approximation for the Lifetime Scheduling Problem of p -Percent Coverage," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2675-2685, September.
    4. Jiao Zhou & Zhao Zhang & Shaojie Tang & Xiaohui Huang & Ding-Zhu Du, 2018. "Breaking the O (ln n ) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 225-235, May.

    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:18:y:2009:i:4:d:10.1007_s10878-009-9229-6. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.