Approximating \(k\)-hop minimum spanning trees in Euclidean metrics (Q963410): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ipl.2008.01.004 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2008.01.004 / rank | |||
Normal rank | |||
Latest revision as of 10:12, 10 December 2024
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
