1 citations · 2 across the 4 of their papers we have counts for
5 papers
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…
Locating Charging Stations: Connected, Capacitated and Prize- Collecting
Rajni Dabas, Neelima Gupta
In this paper, we study locating charging station problem as facility location problem and its variants (-Median, -Facility location and -center). We study the connectivit…
On Variants of Facility Location Problem with Outliers
Rajni Dabas, Neelima Gupta
In this work, we study the extension of two variants of the facility location problem (FL) to make them robust towards a few distantly located clients. First, -facility location…
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…
Uniform Capacitated Facility Location Problems with Penalties/Outliers
Rajni Dabas, Neelima Gupta
In this paper, we present a framework to design approximation algorithms for capacitated facility location problems with penalties/outliers using LP-rounding. Primal-dual technique…