Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees."
@article{DBLP:journals/jal/KleinR95, author = {Philip N. Klein and R. Ravi}, title = {A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees}, journal = {J. Algorithms}, volume = {19}, number = {1}, pages = {104--115}, year = {1995}, url = {https://doi.org/10.1006/jagm.1995.1029}, doi = {10.1006/JAGM.1995.1029}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/KleinR95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/KleinR93a, author = {Philip N. Klein and R. Ravi}, editor = {Giovanni Rinaldi and Laurence A. Wolsey}, title = {A nearly best-possible approximation algorithm for node-weighted Steiner trees}, booktitle = {Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29 - May 1, 1993}, pages = {323--332}, publisher = {{CIACO}}, year = {1993}, timestamp = {Mon, 31 Aug 2015 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/KleinR93a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.