An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane

Authors:
Naveen Garg;Dorit S. Hochbaum
Affiliations:
Department of Computer Science and Engineering, Indian Institute of Technology, Delhi;Industrial Engineering and Operations Research, University of California, Berkeley, CA
Venue:
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Year:
1994

Spanning trees short or small

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms

The minimum latency problem

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Approximation algorithms for geometric tour and network design problems (extended abstract)

Proceedings of the eleventh annual symposium on Computational geometry
Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A constant-factor approximation for the k-MST problem in the plane

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A constant-factor approximation algorithm for the k MST problem (extended abstract)

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Online algorithms for selective multicast and maximal dense trees

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Finding subsets maximizing minimum structures

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Guillotine subdivisions approximate polygonal subdivisions: a simple new method for the geometric k-MST problem

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Saving an epsilon: a 2-approximation for the k-MST problem in graphs

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

Hi-index	0.00