3 citations · 5 across the 7 of their papers we have counts for
6 papers · 1 filter
Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces
Fateme Abbasi, Sandip Banerjee, Jarosław Byrka +6
We consider the well-studied Robust -Clustering problem, which generalizes the classic -Median, -Means, and -Center problems. Given a constant , the input…
Parameterized Approximation Schemes for Clustering with General Norm Objectives
Fateme Abbasi, Sandip Banerjee, Jarosław Byrka +6
This paper considers the well-studied algorithmic regime of designing a -approximation algorithm for a -clustering problem that runs in time (sometimes ca…
Approximation Algorithms for Demand Strip Packing
Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli +1
In the Demand Strip Packing problem (DSP), we are given a time interval and a collection of tasks, each characterized by a processing time and a demand for a given resource (such a…
Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
Zachary Friggstad, Kamyar Khodamoradi, Mohammad R. Salavatipour
We investigate the complexity of solving stable or perturbation-resilient instances of -Means and -Median clustering in fixed dimension Euclidean metrics (more generally doub…
Approximation Schemes for Clustering with Outliers
Zachary Friggstad, Kamyar Khodamoradi, Mohsen Rezapour +1
Clustering problems are well-studied in a variety of fields such as data science, operations research, and computer science. Such problems include variants of centre location probl…
PTAS for Ordered Instances of Resource Allocation Problems with Restrictions on Inclusions
Kamyar Khodamoradi, Ramesh Krishnamurti, Arash Rafiey +1
We consider the problem of allocating a set of indivisible resources (items) to a set of customers (players) competing for the resources. Each resource ha…