Amit Kumar

activity

20152021

most citedA Local-Search Algorithm for Steiner Forest

2 citations · 4 across the 8 of their papers we have counts for

collaborators

Showing 2020Show all

4 papers · 1 filter

cs.DS2020

Algorithms for finding $k$ in $k$ -means

Chiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar

$k -$ means Clustering requires as input the exact value of $k$ , the number of clusters. Two challenges are open: (i) Is there a data-determined definition of $k$ which is provably c…

cs.DS2020

FPT Approximation for Constrained Metric $k$ -Median/Means

Dishant Goyal, Ragesh Jaiswal, Amit Kumar

The Metric $k$ -median problem over a metric space $(X, d)$ is defined as follows: given a set $L \subseteq X$ of facility locations and a set $C \subseteq \math…

cs.DS2020

Online Carpooling using Expander Decompositions

Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar +1

We consider the online carpooling problem: given $n$ vertices, a sequence of edges arrive over time. When an edge $e_{t} = (u_{t}, v_{t})$ arrives at time step $t$ , the algorithm must or…

cs.DS2020

Caching with Time Windows and Delays

Anupam Gupta, Amit Kumar, Debmalya Panigrahi

We consider two generalizations of the classical weighted paging problem that incorporate the notion of delayed service of page requests. The first is the (weighted) Paging with Ti…

Algorithms for finding k in k-means

FPT Approximation for Constrained Metric k-Median/Means

Online Carpooling using Expander Decompositions

Caching with Time Windows and Delays

Algorithms for finding $k$ in $k$ -means

FPT Approximation for Constrained Metric $k$ -Median/Means