Approximating \(k\)-hop minimum spanning trees in Euclidean metrics (Q963410)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating \(k\)-hop minimum spanning trees in Euclidean metrics |
scientific article |
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
