Minimizing the sum of diameters efficiently
From MaRDI portal
Publication:1199831
DOI10.1016/0925-7721(92)90028-QzbMath0773.68069MaRDI QIDQ1199831
Publication date: 17 January 1993
Published in: Computational Geometry (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Cluster analysis and mathematical programming, Computing grasp functions, Covering points with convex sets of minimum size, Three-clustering of points in the plane., Minimum perimeter-sum partitions in the plane, Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The design of dynamic data structures
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- A linear-time algorithm for a special case of disjoint set union
- On the Complexity of Some Common Geometric Location Problems
- Finding tailored partitions
- Geometric clusterings
- Optimal Point Location in a Monotone Subdivision
- Decomposable searching problems I. Static-to-dynamic transformation
- Optimal Search in Planar Subdivisions
- The NP-completeness column: An ongoing gulde
- Maintenance of geometric extrema
