1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.DS2019
Reoptimization of Path Vertex Cover Problem
Mehul Kumar, Amit Kumar, C. Pandu Rangan
Most optimization problems are notoriously hard. Considerable efforts must be spent in obtaining an optimal solution to certain instances that we encounter in the real world scenar…
cs.DS2014★ 1 cited
Improved analysis of D2-sampling based PTAS for k-means and other Clustering problems
Ragesh Jaiswal, Mehul Kumar, Pulkit Yadav
We give an improved analysis of the simple -sampling based PTAS for the -means clustering problem given by Jaiswal, Kumar, and Sen (Algorithmica, 2013). The improvement on…