Approximating the diameter of a set of points in the Euclidean space (Q1123610): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(89)90045-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2022651886 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation algorithms for convex hulls / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3992847 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Constructing Minimum Spanning Trees in <i>k</i>-Dimensional Spaces and Related Problems / rank | |||
Normal rank | |||
Latest revision as of 09:09, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the diameter of a set of points in the Euclidean space |
scientific article |
Statements
Approximating the diameter of a set of points in the Euclidean space (English)
0 references
1989
0 references
computational geometry
0 references
diameter computation
0 references
approximation algorithm
0 references
