1 citations · 3 across the 9 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
cs.DS2025
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…
cs.DS2025
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…
cs.DS2025
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…