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 a ln n for any 0∈
Cite
CITATION STYLE
Zou, F., Li, X., Kim, D., & Wu, W. (2008). Two constant approximation algorithms for node-weighted steiner tree in unit disk graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5165 LNCS, pp. 278–285). https://doi.org/10.1007/978-3-540-85097-7_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
