%0 Journal Article %1 journals/comgeo/CheongHL08 %A Cheong, Otfried %A Haverkort, Herman J. %A Lee, Mira %D 2008 %J Comput. Geom. %K dblp %N 3 %P 188-205 %T Computing a minimum-dilation spanning tree is NP-hard. %U http://dblp.uni-trier.de/db/journals/comgeo/comgeo41.html#CheongHL08 %V 41

@article{journals/comgeo/CheongHL08, added-at = {2009-01-26T00:00:00.000+0100}, author = {Cheong, Otfried and Haverkort, Herman J. and Lee, Mira}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2c5ff38ea838b5323b39fb43122b1efbc/dblp}, ee = {http://dx.doi.org/10.1016/j.comgeo.2007.12.001}, interhash = {3d43375b802443b311ad59fc8b0f82d6}, intrahash = {c5ff38ea838b5323b39fb43122b1efbc}, journal = {Comput. Geom.}, keywords = {dblp}, number = 3, pages = {188-205}, timestamp = {2016-02-02T09:30:57.000+0100}, title = {Computing a minimum-dilation spanning tree is NP-hard.}, url = {http://dblp.uni-trier.de/db/journals/comgeo/comgeo41.html#CheongHL08}, volume = 41, year = 2008 }