TY - JOUR
T1 - Approximation algorithms for maximum dispersion
AU - Hassin, Refael
AU - Rubinstein, Shlomi
AU - Tamir, Arie
PY - 1997/10
Y1 - 1997/10
N2 - We describe approximation algorithms with bounded performance guarantees for the following problem: A graph is given with edge weights satisfying the triangle inequality, together with two numbers k and p. Find k disjoint subsets of p vertices each, so that the total weight of edges within subsets is maximized.
AB - We describe approximation algorithms with bounded performance guarantees for the following problem: A graph is given with edge weights satisfying the triangle inequality, together with two numbers k and p. Find k disjoint subsets of p vertices each, so that the total weight of edges within subsets is maximized.
KW - Approximation algorithms
KW - Facility location
KW - Maximum dispersion
UR - http://www.scopus.com/inward/record.url?scp=0012826421&partnerID=8YFLogxK
U2 - 10.1016/S0167-6377(97)00034-5
DO - 10.1016/S0167-6377(97)00034-5
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0012826421
SN - 0167-6377
VL - 21
SP - 133
EP - 137
JO - Operations Research Letters
JF - Operations Research Letters
IS - 3
ER -