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

DOI10.1145/195058.195218zbMath1344.68285MaRDI QIDQ2817634

Dorit S. Hochbaum, Naveen Garg

Publication date: 1 September 2016

Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/195058.195218

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

68W25: Approximation algorithms

Related Items

\(k\)-edge subgraph problems, Faster geometric \(k\)-point MST approximation, Compact location problems