%0 Journal Article %1 journals/algorithmica/KonemannLS04 %A Könemann, Jochen %A Levin, Asaf %A Sinha, Amitabh %D 2005 %J Algorithmica %K dblp %N 2 %P 117-129 %T Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. %U http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica41.html#KonemannLS04 %V 41

@article{journals/algorithmica/KonemannLS04, added-at = {2017-06-13T00:00:00.000+0200}, author = {Könemann, Jochen and Levin, Asaf and Sinha, Amitabh}, biburl = {https://www.bibsonomy.org/bibtex/248aa7414f23434694963066733218e76/dblp}, ee = {https://doi.org/10.1007/s00453-004-1121-2}, interhash = {11f038e3a094a1fbf58ed0766b4416df}, intrahash = {48aa7414f23434694963066733218e76}, journal = {Algorithmica}, keywords = {dblp}, number = 2, pages = {117-129}, timestamp = {2017-06-14T11:38:16.000+0200}, title = {Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem.}, url = {http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica41.html#KonemannLS04}, volume = 41, year = 2005 }