"Greedy heuristics for the bounded diameter minimum spanning tree problem."

Bryant A. Julstrom (2009)

> Home

Details and statistics

DOI: 10.1145/1498698.1498699

access: closed

type: Journal Article

metadata version: 2020-06-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jea/Julstrom09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jea/Julstrom09
Bryant A. Julstrom:
Greedy heuristics for the bounded diameter minimum spanning tree problem. ACM J. Exp. Algorithmics 14 (2009)

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.