Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree (Q1879253)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree |
scientific article |
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
