Node-weighted Steiner tree approximation in unit disk graphs

Feng Zou (), Xianyue Li (), Suogang Gao () and Weili Wu ()
Additional contact information
Feng Zou: University of Texas at Dallas
Xianyue Li: Lanzhou University
Suogang Gao: Hebei Normal University
Weili Wu: University of Texas at Dallas

Journal of Combinatorial Optimization, 2009, vol. 18, issue 4, No 2, 342-349

Abstract: 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

Keywords: Node-weighted Steiner tree; Approximation algorithm; Unit disk graphs (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-009-9229-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:18:y:2009:i:4:d:10.1007_s10878-009-9229-6

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-009-9229-6

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().