Approximating \(k\)-hop minimum spanning trees in Euclidean metrics (Q963410): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2008.01.004 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2039405536 / rank | |||
Normal rank |
Revision as of 21:51, 19 March 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