1 citations · 2 across the 11 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
cs.LG2024
Fair Clustering for Data Summarization: Improved Approximation Algorithms and Complexity Insights
Ameet Gadekar, Aristides Gionis, Suhas Thejaswi
Data summarization tasks are often modeled as -clustering problems, where the goal is to choose data points, called cluster centers, that best represent the dataset by minim…
cs.DS2024
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…
cs.DS2024
Diversity-aware clustering: Computational Complexity and Approximation Algorithms
Suhas Thejaswi, Ameet Gadekar, Bruno Ordozgoiti +1
In this work, we study diversity-aware clustering problems where the data points are associated with multiple attributes resulting in intersecting groups. A clustering solution nee…