%0 Conference Proceedings
%A Cheong, Otfried
%A Haverkorty, Herman
%A Lee, Mira
%D 2007
%T Computing a Minimum-Dilation Spanning Tree is NP-hard
%E Gudmundsson, Joachim
%E Jay, Barry
%B Thirteenth Computing: The Australasian Theory Symposium (CATS2007)
%C Ballarat, Australia
%I ACS
%V 65
%P 15-24
%S CRPIT
%! Computing a Minimum-Dilation Spanning Tree is NP-hard
%F CRPITV65-15-24
%Z abstract
%U http://crpit.com/confpapers/CRPITV65Cheong.pdf