Universal Algorithms for Clustering

05/05/2021
by   Arun Ganesh, et al.
0

This paper presents universal algorithms for clustering problems, including the widely studied k-median, k-means, and k-center objectives. The input is a metric space containing all potential client locations. The algorithm must select k cluster centers such that they are a good solution for any subset of clients that actually realize. Specifically, we aim for low regret, defined as the maximum over all subsets of the difference between the cost of the algorithm's solution and that of an optimal solution. A universal algorithm's solution SOL for a clustering problem is said to be an (α, β)-approximation if for all subsets of clients C', it satisfies SOL(C') ≤α· OPT(C') + β· MR, where OPT(C') is the cost of the optimal solution for clients C' and MR is the minimum regret achievable by any solution. Our main results are universal algorithms for the standard clustering objectives of k-median, k-means, and k-center that achieve (O(1), O(1))-approximations. These results are obtained via a novel framework for universal algorithms using linear programming (LP) relaxations. These results generalize to other ℓ_p-objectives and the setting where some subset of the clients are fixed. We also give hardness results showing that (α, β)-approximation is NP-hard if α or β is at most a certain constant, even for the widely studied special case of Euclidean metric spaces. This shows that in some sense, (O(1), O(1))-approximation is the strongest type of guarantee obtainable for universal clustering.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/30/2020

On Approximability of Clustering Problems Without Candidate Centers

The k-means objective is arguably the most widely-used cost function for...
research
04/06/2023

Parameterized Approximation Schemes for Clustering with General Norm Objectives

This paper considers the well-studied algorithmic regime of designing a ...
research
05/17/2020

Robust Algorithms for TSP and Steiner Tree

Robust optimization is a widely studied area in operations research, whe...
research
10/04/2022

Bicriteria Approximation Algorithms for Priority Matroid Median

Fairness considerations have motivated new clustering problems and algor...
research
11/10/2022

An O(loglog n)-Approximation for Submodular Facility Location

In the Submodular Facility Location problem (SFL) we are given a collect...
research
06/30/2022

Approximation Algorithms for Continuous Clustering and Facility Location Problems

We consider the approximability of center-based clustering problems wher...
research
11/21/2021

Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in L_p metrics

K-median and k-means are the two most popular objectives for clustering ...

Please sign up or login with your details

Forgot password? Click here to reset