1 citations · 1 across the 2 of their papers we have counts for
2 papers
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…
cs.DS2016★ 1 cited
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…