A Nearly best-possible approximation algorithm for node-weighted Steiner trees

Authors:
Philip Klein;R. Ravi
Affiliations:
-;-
Venue:
A Nearly best-possible approximation algorithm for node-weighted Steiner trees
Year:
1992

Citing 0
Cited 1

Truthful multicast routing in selfish wireless networks

Proceedings of the 10th annual international conference on Mobile computing and networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give the first approximation algorithm for the node-weighted Steiner tree problem. Its performance guarantee is within a constant factor of the best possible unless $\tilde P \supseteq NP$. Our algorithm generalizes to handle other network design problems.