10 citations · 33 across the 24 of their papers we have counts for
3 papers · 2 filters
On Colorful Vertex and Edge Cover Problems
Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore
In this paper, we study two generalizations of Vertex Cover and Edge Cover, namely Colorful Vertex Cover and Colorful Edge Cover. In the Colorful Vertex Cover problem, given an …
FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii
Sayan Bandyapadhyay, William Lochet, Saket Saurabh
Clustering with capacity constraints is a fundamental problem that attracted significant attention throughout the years. In this paper, we give the first FPT constant-factor approx…
Proportionally Fair Matching with Multiple Groups
Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar +1
The study of fair algorithms has become mainstream in machine learning and artificial intelligence due to its increasing demand in dealing with biases and discrimination. Along thi…