15 citations · 45 across the 13 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019★ 3 cited
A Constant Approximation for Colorful k-Center
Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai +1
In this paper, we consider the colorful -center problem, which is a generalization of the well-known -center problem. Here, we are given red and blue points in a metric space…
cs.DS2019★ 3 cited
Faster Algorithms for the Geometric Transportation Problem
Pankaj K. Agarwal, Kyle Fox, Debmalya Panigrahi +2
Let and be two point sets in , with and where is a constant. Next, let such that $\sum_{r \in R } λ(r) = \sum_…