An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane
From MaRDI portal
Publication:2817634
DOI10.1145/195058.195218zbMath1344.68285OpenAlexW2032389500MaRDI 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
Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (3)
\(k\)-edge subgraph problems ⋮ Faster geometric \(k\)-point MST approximation ⋮ Compact location problems
This page was built for publication: An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane
