An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane (Q679454)
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( k)-approximation algorithm for the k minimum spanning tree problem in the plane |
scientific article; zbMATH DE number 1002570
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane |
scientific article; zbMATH DE number 1002570 |
Statements
An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane (English)
0 references
29 May 1997
0 references
grids
0 references
traveling salesman problem
0 references
minimum tree
0 references
0.911676287651062
0 references
0.858364462852478
0 references
0.8542357683181763
0 references
