Approximation algorithms for min-sum p-clustering

Nili Guttmann-Beck, Refael Hassin*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

We consider the following problem: Given a graph with edge lengths satisfying the triangle inequality, partition its node set into p subsets, minimizing the total length of edges whose two ends are in the same subset. For this problem we present an approximation algorithm which comes to at most twice the optimal value. For clustering into two equal-sized sets, the exact bound on the maximum possible error ratio of our algorithm is between 1.686 and 1.7.

Original languageEnglish
Pages (from-to)125-142
Number of pages18
JournalDiscrete Applied Mathematics
Volume89
Issue number1-3
DOIs
StatePublished - 1 Dec 1998

Keywords

  • Approximation algorithm
  • p-clustering

Fingerprint

Dive into the research topics of 'Approximation algorithms for min-sum p-clustering'. Together they form a unique fingerprint.

Cite this