%0 Journal Article %1 journals/jal/KleinR95 %A Klein, Philip N. %A Ravi, R. %D 1995 %J J. Algorithms %K dblp %N 1 %P 104-115 %T A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees. %U http://dblp.uni-trier.de/db/journals/jal/jal19.html#KleinR95 %V 19

@article{journals/jal/KleinR95, added-at = {2015-08-31T00:00:00.000+0200}, author = {Klein, Philip N. and Ravi, R.}, biburl = {https://www.bibsonomy.org/bibtex/2abfb1a5f10ac7e7b0ce248979a42eff6/dblp}, ee = {http://dx.doi.org/10.1006/jagm.1995.1029}, interhash = {a1d9c05a5fd1ac7b5d20787a458d807a}, intrahash = {abfb1a5f10ac7e7b0ce248979a42eff6}, journal = {J. Algorithms}, keywords = {dblp}, number = 1, pages = {104-115}, timestamp = {2015-09-01T11:33:06.000+0200}, title = {A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees.}, url = {http://dblp.uni-trier.de/db/journals/jal/jal19.html#KleinR95}, volume = 19, year = 1995 }