Approximation algorithms for maximum dispersion

Approximation algorithms for maximum dispersion

0.00 Avg rating0 Votes
Article ID: iaor20001021
Country: Netherlands
Volume: 21
Issue: 3
Start Page Number: 133
End Page Number: 137
Publication Date: Oct 1997
Journal: Operations Research Letters
Authors: , ,
Keywords: heuristics
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.