1 citations · 3 across the 9 of their papers we have counts for
10 papers · 1 filter
Capacitated Partition Vertex Cover and Partition Edge Cover
Rajni Dabas, Samir Khuller, Emilie Rivkin
Our first focus is the Capacitated Partition Vertex Cover (C-PVC) problem in hypergraphs. In C-PVC, we are given a hypergraph with capacities on its vertices and a partition of the…
Weighted Partition Vertex and Edge Cover
Rajni Dabas, Samir Khuller, Emilie Rivkin
We study generalizations of the classical Vertex Cover and Edge Cover problems that incorporate group-wise coverage constraints. Our first focus is the \emph{Weighted Prize-Collect…
Facility Location and -Median with Fair Outliers
Rajni Dabas, Samir Khuller, Emilie Rivkin
Classical clustering problems such as \emph{Facility Location} and \emph{-Median} aim to efficiently serve a set of clients from a subset of facilities -- minimizing the total c…
FPT Approximations for Capacitated/Fair Clustering with Outliers
Rajni Dabas, Neelima Gupta, Tanmay Inamdar
Clustering problems such as -Median, and -Means, are motivated from applications such as location planning, unsupervised learning among others. In such applications, it is im…
Near-optimal Algorithms for Stochastic Online Bin Packing
Nikhil Ayyadevara, Rajni Dabas, Arindam Khan +1
We study the online bin packing problem under two stochastic settings. In the bin packing problem, we are given n items with sizes in (0,1] and the goal is to pack them into the mi…
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…