1 citations · 2 across the 4 of their papers we have counts for
4 papers · 1 filter
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…
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…
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…
Constant factor Approximation Algorithms for Uniform Hard Capacitated Facility Location Problems: Natural LP is not too bad
Sapna Grover, Neelima Gupta, Samir Khuller +1
In this paper, we give first constant factor approximation for capacitated knapsack median problem (CKM) for hard uniform capacities, violating the budget only by an additive facto…