Clustering to minimize the maximum intercluster distance (Q1059958): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 03:03, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Clustering to minimize the maximum intercluster distance |
scientific article |
Statements
Clustering to minimize the maximum intercluster distance (English)
0 references
1985
0 references
The problem of clustering a set of points so as to minimize the maximum intercluster distance is studied. An O(kn) approximation algorithm, where n is the number of points and k is the number of clusters, that guarantees solutions with an objective function value within two times the optimal solution value is presented. This approximation algorithm succeeds as long as the set of points satisfies the triangular inequality. We also show that our approximation algorithm is best possible, with respect to the approximation bound, if \(P\neq NP\).
0 references
NP-completeness
0 references
minimizing maximum intercluster distance
0 references
clustering
0 references
approximation algorithm
0 references
triangular inequality
0 references