2 citations · 2 across the 1 of their papers we have counts for
2 papers
cs.DS2017★ 2 cited
A Local-Search Algorithm for Steiner Forest
Martin Groß, Anupam Gupta, Amit Kumar +4
In the Steiner Forest problem, we are given a graph and a collection of source-sink pairs, and the goal is to find a subgraph of minimum total length such that all pairs are connec…
cs.DS2015
Faster Algorithms for the Constrained k-means Problem
Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar
The classical center based clustering problems such as -means/median/center assume that the optimal clusters satisfy the locality property that the points in the same cluster ar…