"Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree."

Michael J. Spriggs et al. (2004)

> Home

Details and statistics

DOI: 10.1007/S00453-003-1056-Z

access: closed

type: Journal Article

metadata version: 2018-11-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/SpriggsKBSS04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/SpriggsKBSS04
Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink:
Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree. Algorithmica 38(4): 577-589 (2004)

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.