Approximation algorithms for min-sum \(p\)-clustering

DOI10.1016/S0166-218X(98)00100-0zbMath0921.68044MaRDI QIDQ1281390

Nili Guttmann-Beck, Refael Hassin

Publication date: 22 March 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

approximation algorithm\(p\)-clustering

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Related Items (9)

Constrained minimum-\(k\)-star clustering and its application to the consolidation of farmland ⋮ Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median ⋮ Clustering to minimize the sum of cluster diameters ⋮ Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town? ⋮ Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median ⋮ Communication-aware processor allocation for supercomputers: Finding point sets of small average distance ⋮ Small space representations for metric min-sum \(k\)-clustering and their applications ⋮ Min sum clustering with penalties ⋮ Approximating the maximum quadratic assignment problem

Cites Work

• Printer graphics for clustering
• P-Complete Approximation Problems
• Geometric algorithms for the minimum cost assignment problem
• Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
• On the completeness of a generalized matching problem

This page was built for publication: Approximation algorithms for min-sum \(p\)-clustering