| Title: |
A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees |
| Article URLs: |
|
| Alternative Article URLs: |
|
| Authors: |
Sunil Arya |
-
The Hong Kong University of Science and Technology, Dept. of Computer Science and Engineering
|
| David M. Mount |
-
University of Maryland, Dept. of Computer Science
-
University of Maryland, Inst. for Advanced Computer Studies
|
| Sharing: |
Unknown
|
| Verification: |
Authors have
not verified
information
|
| Artifact Evaluation Badge: |
none
|
| Artifact URLs: |
|
| Artifact Correspondence Email Addresses: |
|
| NSF Award Numbers: |
1117259
|
| DBLP Key: |
conf/soda/AryaM16
|
| Author Comments: |
|