10 papers
On the Parameterized Approximability of (Mergeable) Sum of Radii Clustering
Ameet Gadekar
The sum of radii problem (-MSR) asks, given a metric space on points, to place balls covering all points so as to minimize the sum of their radii. Despite extensive stud…
FPT Approximations for Fair Sum of Radii with Outliers and General Norm Objectives
Ameet Gadekar
The sum of radii problem is a classical clustering problem in which, given a set of points and an integer , the goal is to place balls that cover while minimizing th…
Clustering under Constraints: Efficient Parameterized Approximation Schemes
Sujoy Bhore, Ameet Gadekar, Tanmay Inamdar
We present a unified framework that yields EPASes for constrained -clustering in metric spaces of bounded (algorithmic) scatter dimension, a notion introduced by Abbasi et a…
Fair Committee Selection under Ordinal Preferences and Limited Cardinal Information
Ameet Gadekar, Aristides Gionis, Suhas Thejaswi +1
We study the problem of fair -committee selection under an egalitarian objective. Given agents partitioned into groups (\eg, demographic quotas), the goal is to aggregat…
Label-consistent clustering for evolving data
Ameet Gadekar, Aristides Gionis, Thibault Marette
Data analysis often involves an iterative process, where solutions must be continuously refined in response to new data. Typically, as new data becomes available, an existing solut…
FPT approximations for Capacitated Sum of Radii and Diameters
Arnold Filtser, Ameet Gadekar
The Capacitated Sum of Radii problem involves partitioning a set of points , where each point has capacity , into clusters that minimize the sum of cluster rad…