Parameterized Approximation Schemes for Clustering with General Norm Objectives

04/06/2023
by   Fateme Abbasi, et al.
0

This paper considers the well-studied algorithmic regime of designing a (1+ϵ)-approximation algorithm for a k-clustering problem that runs in time f(k,ϵ)poly(n) (sometimes called an efficient parameterized approximation scheme or EPAS for short). Notable results of this kind include EPASes in the high-dimensional Euclidean setting for k-center [Badŏiu, Har-Peled, Indyk; STOC'02] as well as k-median, and k-means [Kumar, Sabharwal, Sen; J. ACM 2010]. However, existing EPASes handle only basic objectives (such as k-center, k-median, and k-means) and are tailored to the specific objective and metric space. Our main contribution is a clean and simple EPAS that settles more than ten clustering problems (across multiple well-studied objectives as well as metric spaces) and unifies well-known EPASes. Our algorithm gives EPASes for a large variety of clustering objectives (for example, k-means, k-center, k-median, priority k-center, ℓ-centrum, ordered k-median, socially fair k-median aka robust k-median, or more generally monotone norm k-clustering) and metric spaces (for example, continuous high-dimensional Euclidean spaces, metrics of bounded doubling dimension, bounded treewidth metrics, and planar metrics). Key to our approach is a new concept that we call bounded ϵ-scatter dimension–an intrinsic complexity measure of a metric space that is a relaxation of the standard notion of bounded doubling dimension. Our main technical result shows that two conditions are essentially sufficient for our algorithm to yield an EPAS on the input metric M for any clustering objective: (i) The objective is described by a monotone (not necessarily symmetric!) norm, and (ii) the ϵ-scatter dimension of M is upper bounded by a function of ϵ.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/12/2023

Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces

We consider the well-studied Robust (k, z)-Clustering problem, which gen...
research
08/30/2022

On the Fixed-Parameter Tractability of Capacitated Clustering

We study the complexity of the classic capacitated k-median and k-means ...
research
05/05/2021

Universal Algorithms for Clustering

This paper presents universal algorithms for clustering problems, includ...
research
12/20/2018

Near-Linear Time Approximation Schemes for Clustering in Doubling Metrics

We consider the classic Facility Location, k-Median, and k-Means problem...
research
03/02/2023

Coresets for Clustering in Geometric Intersection Graphs

Designing coresets–small-space sketches of the data preserving cost of t...
research
02/22/2023

The Power of Uniform Sampling for k-Median

We study the power of uniform sampling for k-Median in various metric sp...
research
07/10/2019

Coresets for Clustering in Graphs of Bounded Treewidth

We initiate the study of coresets for clustering in graph metrics, i.e.,...

Please sign up or login with your details

Forgot password? Click here to reset