Naveen Garg, Dorit S. Hochbaum. An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane. In Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23-25 May 1994, Montréal, Québec, Canada. pages 432-438, ACM, 1994. [doi]
@inproceedings{GargH94,
title = {An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane},
author = {Naveen Garg and Dorit S. Hochbaum},
year = {1994},
doi = {10.1145/195058.195218},
url = {http://doi.acm.org/10.1145/195058.195218},
researchr = {https://researchr.org/publication/GargH94},
cites = {0},
citedby = {0},
pages = {432-438},
booktitle = {Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23-25 May 1994, Montréal, Québec, Canada},
publisher = {ACM},
}