Node-weighted Steiner tree approximation in unit disk graphs
Author
Abstract
Suggested Citation
DOI: 10.1007/s10878-009-9229-6
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- 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.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- 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.
- 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.
- 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.
- 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.- 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.
- 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.
- 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.
- 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.
More about this item
Keywords
Node-weighted Steiner tree; Approximation algorithm; Unit disk graphs;All these keywords.
Statistics
Access and download statisticsCorrections
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.