Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
Local Search for Fair Max-Min Diversification
Sepideh Mahabadi, Shyam Narayanan, Varun Sivashankar
Given points in a metric space, Max-Min diversification asks for a subset of points maximizing the minimum pairwise distance between the selected points. This is arguably t…
cs.DS2023
Composable Coresets for Determinant Maximization: Greedy is Almost Optimal
Siddharth Gollapudi, Sepideh Mahabadi, Varun Sivashankar
Given a set of vectors in , the goal of the \emph{determinant maximization} problem is to pick vectors with the maximum volume. Determinant maximization is th…
cs.DS2023
Improved Approximation Algorithms for the Joint Replenishment Problem with Outliers, and with Fairness Constraints
Varun Suriyanarayana, Varun Sivashankar, Siddharth Gollapudi +1
The joint replenishment problem (JRP) is a classical inventory management problem. We consider a natural generalization with outliers, where we are allowed to reject (that is, not…