%0 Conference Paper %1 conf/fsttcs/KonemannR03 %A Könemann, Jochen %A Ravi, R. %B FSTTCS %D 2003 %E Pandya, Paritosh K. %E Radhakrishnan, Jaikumar %I Springer %K dblp %P 289-301 %T Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees. %U http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2003.html#KonemannR03 %V 2914 %@ 3-540-20680-9

@inproceedings{conf/fsttcs/KonemannR03, added-at = {2017-05-24T00:00:00.000+0200}, author = {Könemann, Jochen and Ravi, R.}, biburl = {https://www.bibsonomy.org/bibtex/21fc503566044ab22efb1e2e459881ade/dblp}, booktitle = {FSTTCS}, crossref = {conf/fsttcs/2003}, editor = {Pandya, Paritosh K. and Radhakrishnan, Jaikumar}, ee = {https://doi.org/10.1007/978-3-540-24597-1_25}, interhash = {d171a91ae0f131931741a3e66dceb857}, intrahash = {1fc503566044ab22efb1e2e459881ade}, isbn = {3-540-20680-9}, keywords = {dblp}, pages = {289-301}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T19:08:53.000+0200}, title = {Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees.}, url = {http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2003.html#KonemannR03}, volume = 2914, year = 2003 }