DeepAI AI Chat
Log In Sign Up

Approximation algorithms for k-median with lower-bound constraints

by   Ameet Gadekar, et al.

We study a variant of the classical k-median problem known as diversity-aware k-median (introduced by Thejaswi et al. 2021), where we are given a collection of facility subsets, and a solution must contain at least a specified number of facilities from each subset.We investigate the fixed-parameter tractability of this problem and show several negative hardness and inapproximability results, even when we afford exponential running time with respect to some parameters of the problem. Motivated by these results we present a fixed parameter approximation algorithm with approximation ratio (1 + 2/e +ϵ), and argue that this ratio is essentially tight assuming the gap-exponential time hypothesis. We also present a simple, practical local-search algorithm that gives a bicriteria (2k, 3+ϵ) approximation with better running time bounds.


page 1

page 2

page 3

page 4


Pinning Down the Strong Wilber 1 Bound for Binary Search Trees

The famous dynamic optimality conjecture of Sleator and Tarjan from 1985...

Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search

We generalize the monotone local search approach of Fomin, Gaspers, Loks...

Approximation and Parameterized Complexity of Minimax Approval Voting

We present three results on the complexity of Minimax Approval Voting. F...

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

The k-Median problem is one of the well-known optimization problems that...

A Faster FPTAS for the Subset-Sums Ratio Problem

The Subset-Sums Ratio problem (SSR) is an optimization problem in which,...

A Double Exponential Lower Bound for the Distinct Vectors Problem

In the (binary) Distinct Vectors problem we are given a binary matrix A ...