TY - JOUR

T1 - Approximation algorithms for min-sum p-clustering

AU - Guttmann-Beck, Nili

AU - Hassin, Refael

PY - 1998/12/1

Y1 - 1998/12/1

N2 - 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.

AB - 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.

KW - Approximation algorithm

KW - p-clustering

UR - http://www.scopus.com/inward/record.url?scp=0001225295&partnerID=8YFLogxK

U2 - 10.1016/S0166-218X(98)00100-0

DO - 10.1016/S0166-218X(98)00100-0

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0001225295

SN - 0166-218X

VL - 89

SP - 125

EP - 142

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 1-3

ER -