Tanvi Bajpai

activity

20182025

collaborators

4 papers

cs.DS2025

Covering a Few Submodular Constraints and Applications

Tanvi Bajpai, Chandra Chekuri, Pooja Kulkarni

We consider the problem of covering multiple submodular constraints. Given a finite ground set $N$ , a cost function $c : N \to R_{+}$ , $r$ monotone submodular functio…

cs.DS2022

Bicriteria Approximation Algorithms for Priority Matroid Median

Tanvi Bajpai, Chandra Chekuri

Fairness considerations have motivated new clustering problems and algorithms in recent years. In this paper we consider the Priority Matroid Median problem which generalizes the P…

cs.DS2021

Revisiting Priority $k$ -Center: Fairness and Outliers

Tanvi Bajpai, Deeparnab Chakrabarty, Chandra Chekuri +1

In the Priority $k$ -Center problem, the input consists of a metric space $(X, d)$ , an integer $k$ , and for each point $v \in X$ a priority radius $r (v)$ . The goal is to choose $k$ -c…

cs.IR2018

A new system-wide diversity measure for recommendations with efficient algorithms

Arda Antikacioglu, Tanvi Bajpai, R. Ravi

Recommender systems often operate on item catalogs clustered by genres, and user bases that have natural clusterings into user types by demographic or psychographic attributes. Pri…

Covering a Few Submodular Constraints and Applications

Bicriteria Approximation Algorithms for Priority Matroid Median

Revisiting Priority k-Center: Fairness and Outliers

A new system-wide diversity measure for recommendations with efficient algorithms

Revisiting Priority $k$ -Center: Fairness and Outliers