Clustering problems

Subject

Browse all works related to Clustering problems.

"1" Result
Sort By:

Approximation algorithms for clustering problems

by Babak Behsaz

0 Type: Thesis

In this thesis, we present some approximation algorithms for the following clustering problems: Minimum Sum of Radii (MSR), Minimum Sum of Diameters (MSD), and Unsplittable Capacitated Facility Location (UCFL). Given a metric (V,d) and an integer k, we consider the problem of pa…