28 citations · 73 across the 23 of their papers we have counts for
33 papers
Universal Weak Coreset
Ragesh Jaiswal, Amit Kumar
Coresets for -means and -median problems yield a small summary of the data, which preserve the clustering cost with respect to any set of centers. Recently coresets have…
Clustering What Matters in Constrained Settings
Ragesh Jaiswal, Amit Kumar
Constrained clustering problems generalize classical clustering formulations, e.g., -median, -means, by imposing additional constraints on the feasibility of clustering. Ther…
Bag-of-Tasks Scheduling on Related Machines
Anupam Gupta, Amit Kumar, Sahil Singla
We consider online scheduling to minimize weighted completion time on related machines, where each job consists of several tasks that can be concurrently executed. A job gets compl…
Algorithms for finding in -means
Chiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar
means Clustering requires as input the exact value of , the number of clusters. Two challenges are open: (i) Is there a data-determined definition of which is provably c…
FPT Approximation for Constrained Metric -Median/Means
Dishant Goyal, Ragesh Jaiswal, Amit Kumar
The Metric -median problem over a metric space is defined as follows: given a set of facility locations and a set $C \subseteq \math…
Online Carpooling using Expander Decompositions
Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar +1
We consider the online carpooling problem: given vertices, a sequence of edges arrive over time. When an edge arrives at time step , the algorithm must or…