Approximation algorithms for maximum dispersion

Refael Hassin, Shlomi Rubinstein, Arie Tamir

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Pages (from-to)133-137
Number of pages5
JournalOperations Research Letters
Volume21
Issue number3
DOIs
StatePublished - Oct 1997

Keywords

  • Approximation algorithms
  • Facility location
  • Maximum dispersion

Fingerprint

Dive into the research topics of 'Approximation algorithms for maximum dispersion'. Together they form a unique fingerprint.

Cite this