1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.DS2022
Constant factor approximations for Lower and Upper bounded Clusterings
Neelima Gupta, Sapna Grover, Rajni Dabas
Clustering is one of the most fundamental problem in Machine Learning. Researchers in the field often require a lower bound on the size of the clusters to maintain anonymity and up…
cs.DS2021★ 1 cited
First Approximation for Uniform Lower and Upper Bounded Facility Location Problem avoiding violation in Lower Bounds
Sapna Grover, Neelima Gupta, Rajni Dabas
With growing emphasis on e-commerce marketplace platforms where we have a central platform mediating between the seller and the buyer, it becomes important to keep a check on the a…
cs.DS2018
Improved Local Search Based Approximation Algorithm for Hard Uniform Capacitated k-Median Problem
Neelima Gupta, Aditya Pancholi
In this paper, we study the hard uniform capacitated - median problem using local search heuristic. Obtaining a constant factor approximation for the \ckm problem is open. All t…