"Computing a Minimum-Dilation Spanning Tree is NP-hard."

Otfried Cheong, Herman J. Haverkort, Mira Lee (2007)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2021-02-08

- view
  - electronic edition @ westernsydney.edu.au (open access)
- export record
  dblp key:
  - conf/cats/CheongHL07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cats/CheongHL07
Otfried Cheong, Herman J. Haverkort, Mira Lee:
Computing a Minimum-Dilation Spanning Tree is NP-hard. CATS 2007: 15-24

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.