Rankings
Publications
Sources
Publishers
Scholars
Organizations
About
Login
Register
Home
Publications
A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
Home
Publications
A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
PK
P. Klein
P. Klein
R. Ravi
R. Ravi
Publisher Website
Google Scholar
Cite
Download
Share
Download
1 July 1995
journal article
Published by
Elsevier BV
in
Journal of Algorithms
Vol. 19
(1)
,
104-115
https://doi.org/10.1006/jagm.1995.1029
Abstract
No abstract available
Cited by 285 articles