Opening book details…
About this Computer Science article
Computing a minimum-dilation spanning tree is NP-hard by Otfried Cheong; Herman Haverkort; Mira Lee is a Computer Science article available to read on EtoBox.
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Otfried Cheong; Herman Haverkort; Mira Lee
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0925-7721)
- Published
- 2008
- Language
- EN
- Field
- Computer Science (Physical Sciences)