15 citations · 45 across the 13 of their papers we have counts for
20 papers
Near-Optimal Online Metric Matching on -ary HST
Parth Gor, Sourya Roy, Kasturi Varadarajan
In the online metric matching problem, we have servers with known locations in some metric space. Requests arrive one-by-one at certain locations, and upon arrival a request mu…
Non-Uniform -Center and Greedy Clustering
Tanmay Inamdar, Kasturi Varadarajan
In the Non-Uniform -Center problem, a generalization of the famous -center clustering problem, we want to cover the given set of points in a metric space by finding a placeme…
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…
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_…
On the Partition Set Cover Problem
Tanmay Inamdar, Kasturi Varadarajan
Several algorithms with an approximation guarantee of are known for the Set Cover problem, where is the number of elements. We study a generalization of the Set Cov…
On Partial Covering For Geometric Set Systems
Tanmay Inamdar, Kasturi Varadarajan
We study a generalization of the Set Cover problem called the \emph{Partial Set Cover} in the context of geometric set systems. The input to this problem is a set system $(X, \math…