Minimizing the sum of diameters efficiently
- 1 October 1992
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 2 (2) , 111-118
- https://doi.org/10.1016/0925-7721(92)90028-q
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Finding tailored partitionsJournal of Algorithms, 1991
- Geometric clusteringsJournal of Algorithms, 1991
- Maintenance of geometric extremaJournal of the ACM, 1991
- A linear-time algorithm for computing the voronoi diagram of a convex polygonDiscrete & Computational Geometry, 1989
- An optimal algorithm for intersecting three-dimensional convex polyhedraPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Clustering algorithms based on minimum and maximum spanning treesPublished by Association for Computing Machinery (ACM) ,1988
- Algorithms in Combinatorial GeometryPublished by Springer Nature ,1987
- Optimal Point Location in a Monotone SubdivisionSIAM Journal on Computing, 1986
- A linear-time algorithm for a special case of disjoint set unionJournal of Computer and System Sciences, 1985
- Decomposable searching problems I. Static-to-dynamic transformationJournal of Algorithms, 1980