Clustering to minimize the maximum intercluster distance

DOI10.1016/0304-3975(85)90224-5zbMath0567.62048WikidataQ57568243 ScholiaQ57568243MaRDI QIDQ1059958

Teofilo F. Gonzalez

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90224-5

zbMATH Keywords

clustering; approximation algorithm; NP-completeness; minimizing maximum intercluster distance; triangular inequality

Mathematics Subject Classification ID

62H30: Classification and discrimination; cluster analysis (statistical aspects)

68R10: Graph theory (including graph drawing) in computer science

Related Items

Unnamed Item, On Min-Max r-Gatherings, New Algorithms for k-Center and Extensions, JOINT SEPARATION OF GEOMETRIC CLUSTERS AND THE EXTREME IRREGULARITIES OF REGULAR POLYHEDRA, Approximation algorithms for hierarchical location problems, Approximation algorithms for Hamming clustering problems, A linear-space algorithm for distance preserving graph embedding, Hexagonal unit network - a tool for proving the NP-completeness results of geometric problems, Approximation algorithms for geometric median problems, Generalized \(p\)-center problems: Complexity results and approximation algorithms, Compact location problems, Fault tolerant \(K\)-center problems, Performance guarantees for hierarchical clustering, Approximating uniform triangular meshes in polygons., A constant-factor approximation algorithm for the \(k\)-median problem, A multi-dimensional approach to force-directed layouts of large graphs, FCM-based model selection algorithms for determining the number of clusters, Deformable spanners and applications, Optimization on Lie manifolds and pattern recognition, A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM, An Optimal Incremental Algorithm for Minimizing Lateness with Rejection

Cites Work

• Computer-oriented approaches to pattern recognition
• On Grouping for Maximum Homogeneity
• The Complexity of Near-Optimal Graph Coloring
• P-Complete Approximation Problems
• An Analysis of Some Graph Theoretical Cluster Techniques
• Automatische Klassifikation
• Admissible clustering procedures
• A graph theoretic approach to the grouping of ordering data
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item