Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree (Q1879253)
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: Computing a (1+)-approximate geometric minimum-diameter spanning tree |
scientific article; zbMATH DE number 2101913
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree |
scientific article; zbMATH DE number 2101913 |
Statements
Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree (English)
0 references
22 September 2004
0 references
Minimum diameter spanning tree
0 references
Approximation algorithm
0 references
Geometric graph
0 references
0.853448212146759
0 references
0.8255465626716614
0 references
0.8244878053665161
0 references
