Constant factor approximations for Lower and Upper bounded Clusterings

by   Neelima Gupta, et al.

Clustering is one of the most fundamental problem in Machine Learning. Researchers in the field often require a lower bound on the size of the clusters to maintain anonymity and upper bound for the ease of analysis. Specifying an optimal cluster size is a problem often faced by scientists. In this paper, we present a framework to obtain constant factor approximations for some prominent clustering objectives, with lower and upper bounds on cluster size. This enables scientists to give an approximate cluster size by specifying the lower and the upper bounds for it. Our results preserve the lower bounds but may violate the upper bound a little. when either of the bounds is uniform. We apply our framework to give the first constant factor approximations for LUkM and its generalization, k-facility location problem (LUkFL), with β+1 factor violation in upper bounds where β is the violation of upper bounds in solutions of upper bounded k-median and k-facility location problems respectively. We also present a result on LUkC with uniform upper bounds and, its generalization, lower and (uniform) upper bounded k supplier problem (LUkS). The approach also gives a result on lower and upper bounded facility location problem (LUFL), improving upon the upper bound violation of 5/2 due to Gupta et al. We also reduce the violation in upper bounds for a special case when the gap between the lower and upper bounds is not too small.


page 1

page 2

page 3

page 4


First Approximation for Uniform Lower and Upper Bounded Facility Location Problem avoiding violation in Lower Bounds

With growing emphasis on e-commerce marketplace platforms where we have ...

Sharp indistinguishability bounds from non-uniform approximations

We study the problem of distinguishing between two symmetric probability...

A balanced k-means algorithm for weighted point sets

The classical k-means algorithm for partitioning n points in R^d into k ...

Prediction, Learning, Uniform Convergence, and Scale-sensitive Dimensions

We present a new general-purpose algorithm for learning classes of [0,1]...

Anonymous Refugee Housing with Upper-Bounds

Knop and Schierreich [AAMAS '23] recently introduced a novel model of re...

Degree-Bounded Generalized Polymatroids and Approximating the Metric Many-Visits TSP

In the Bounded Degree Matroid Basis Problem, we are given a matroid and ...

On the Equivalence between Kernel Quadrature Rules and Random Feature Expansions

We show that kernel-based quadrature rules for computing integrals can b...

Please sign up or login with your details

Forgot password? Click here to reset