"An O (log k)-Approximation Algorithm for the k Minimum Spanning Tree ..."

Naveen Garg, Dorit S. Hochbaum (1997)

> Home

Details and statistics

DOI: 10.1007/BF02523691

access: closed

type: Journal Article

metadata version: 2021-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/GargH97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/GargH97
Naveen Garg, Dorit S. Hochbaum:
An O (log k)-Approximation Algorithm for the k Minimum Spanning Tree Problem in the Plane. Algorithmica 18(1): 111-121 (1997)

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.