%0 Conference Paper %1 conf/cats/CheongHL07 %A Cheong, Otfried %A Haverkort, Herman J. %A Lee, Mira %B CATS %D 2007 %E Gudmundsson, Joachim %E Jay, C. Barry %I Australian Computer Society %K dblp %P 15-24 %T Computing a Minimum-Dilation Spanning Tree is NP-hard. %U http://dblp.uni-trier.de/db/conf/cats/cats2007.html#CheongHL07 %V 65 %@ 1-920-68246-5

@inproceedings{conf/cats/CheongHL07, added-at = {2021-02-08T00:00:00.000+0100}, author = {Cheong, Otfried and Haverkort, Herman J. and Lee, Mira}, biburl = {https://www.bibsonomy.org/bibtex/2f7bea93ca4aa1d8b2b120c3920a2aa83/dblp}, booktitle = {CATS}, crossref = {conf/cats/2007}, editor = {Gudmundsson, Joachim and Jay, C. Barry}, ee = {http://crpit.scem.westernsydney.edu.au/abstracts/CRPITV65Cheong.html}, interhash = {3931b48dd8894fa122d33b9779c74ba9}, intrahash = {f7bea93ca4aa1d8b2b120c3920a2aa83}, isbn = {1-920-68246-5}, keywords = {dblp}, pages = {15-24}, publisher = {Australian Computer Society}, series = {CRPIT}, timestamp = {2024-04-10T13:04:08.000+0200}, title = {Computing a Minimum-Dilation Spanning Tree is NP-hard.}, url = {http://dblp.uni-trier.de/db/conf/cats/cats2007.html#CheongHL07}, volume = 65, year = 2007 }