Approximating \(k\)-hop minimum spanning trees in Euclidean metrics (Q963410)
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: Approximating \(k\)-hop minimum spanning trees in Euclidean metrics |
scientific article; zbMATH DE number 5694961
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating \(k\)-hop minimum spanning trees in Euclidean metrics |
scientific article; zbMATH DE number 5694961 |
Statements
Approximating \(k\)-hop minimum spanning trees in Euclidean metrics (English)
0 references
19 April 2010
0 references
approximation algorithms
0 references
minimum spanning trees
0 references
depth restriction
0 references
0 references
0 references
0 references
0.95316625
0 references
0.91828346
0 references
0.91606593
0 references
0.9121779
0 references
0.9111679
0 references
0.9111679
0 references
0.9109441
0 references
0 references
0.90417254
0 references
