1 citations · 1 across the 3 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DS2022
Approximation Algorithms for Continuous Clustering and Facility Location Problems
Deeparnab Chakrabarty, Maryam Negahbani, Ankita Sarkar
We consider the approximability of center-based clustering problems where the points to be clustered lie in a metric space, and no candidate centers are specified. We call such pro…
cs.DS2022
Popular Critical Matchings in the Many-to-Many Setting
Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan +1
We consider the many-to-many bipartite matching problem in the presence of two-sided preferences and two-sided lower quotas. The input to our problem is a bipartite graph G=(A U B,…