"Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by ..."

Martin Gruber, Günther R. Raidl (2009)

> Home

Details and statistics

DOI: 10.1007/978-3-642-04772-5_86

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/eurocast/GruberR09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/eurocast/GruberR09
Martin Gruber, Günther R. Raidl:
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics. EUROCAST 2009: 665-672

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.