"Computing a minimum-dilation spanning tree is NP-hard."

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

> Home

Details and statistics

DOI: 10.1016/J.COMGEO.2007.12.001

access: open

type: Journal Article

metadata version: 2021-07-25

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/comgeo/CheongHL08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/comgeo/CheongHL08
Otfried Cheong, Herman J. Haverkort, Mira Lee:
Computing a minimum-dilation spanning tree is NP-hard. Comput. Geom. 41(3): 188-205 (2008)

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.