To Close Is Easier Than To Open: Dual Parameterization To k-Median

by   Jaroslaw Byrka, et al.

The k-Median problem is one of the well-known optimization problems that formalize the task of data clustering. Here, we are given sets of facilities F and clients C, and the goal is to open k facilities from the set F, which provides the best division into clusters, that is, the sum of distances from each client to the closest open facility is minimized. In the Capacitated k-Median, the facilities are also assigned capacities specifying how many clients can be served by each facility. Both problems have been extensively studied from the perspective of approximation algorithms. Recently, several surprising results have come from the area of parameterized complexity, which provided better approximation factors via algorithms with running times of the form f(k)· poly(n). In this work, we extend this line of research by studying a different choice of parameterization. We consider the parameter ℓ = |F| - k, that is, the number of facilities that remain closed. It turns out that such a parameterization reveals yet another behavior of k-Median. We observe that the problem is W[1]-hard but it admits a parameterized approximation scheme. Namely, we present an algorithm with running time 2^O(ℓlog(ℓ/ϵ))· poly(n) that achieves a (1+ϵ)-approximation. On the other hand, we show that under the assumption of Gap Exponential Time Hypothesis, one cannot extend this result to the capacitated version of the problem.



There are no comments yet.


page 1

page 2

page 3

page 4


On Clustering with Discounts

We study the k-median with discounts problem, wherein we are given clien...

Ordered k-Median with Fault-Tolerance and Robustness

We study fault-tolerant ordered k-median and robust ordered k-median, bo...

Median and Mode Ellipse Parameterization for Robust Contour Fitting

Problems that require the parameterization of closed contours arise freq...

Approximation algorithms for k-median with lower-bound constraints

We study a variant of the classical k-median problem known as diversity-...

Inapproximability within W[1]: the case of Steiner Orientation

In the k-Steiner Orientation problem we are given a mixed graph, that is...

Efficient approximation schemes for uniform-cost clustering problems in planar graphs

We consider the k-Median problem on planar graphs: given an edge-weighte...

Minimizing Sum of Non-Convex but Piecewise log-Lipschitz Functions using Coresets

We suggest a new optimization technique for minimizing the sum ∑_i=1^n f...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.