Approximating the diameter of a set of points in the Euclidean space
- 1 September 1989
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 32 (4) , 205-211
- https://doi.org/10.1016/0020-0190(89)90045-8
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incrementalPublished by Association for Computing Machinery (ACM) ,1988
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related ProblemsSIAM Journal on Computing, 1982
- Approximation algorithms for convex hullsCommunications of the ACM, 1982