An \(O(\log k)\) approximation algorithm for the \(k\) minimum spanning tree problem in the plane (Q2817634)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane |
scientific article; zbMATH DE number 6621814
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(\log k)\) approximation algorithm for the \(k\) minimum spanning tree problem in the plane |
scientific article; zbMATH DE number 6621814 |
Statements
1 September 2016
0 references
An \(O(\log k)\) approximation algorithm for the \(k\) minimum spanning tree problem in the plane (English)
0 references
