activity
20072023
most citedNon-monotone submodular maximization under matroid and knapsack constraints

117 citations · 273 across the 35 of their papers we have counts for

collaborators
Showing cs.DSShow all

36 papers · 1 filter

cs.DS2022

Minimum Cost Adaptive Submodular Cover

Hessa Al-Thani, Yubing Cui, Viswanath Nagarajan

Adaptive submodularity is a fundamental concept in stochastic optimization, with numerous applications such as sensor placement, hypothesis identification and viral marketing. We c…

cs.DS2021

On Some Variants of Euclidean K-Supplier

Euiwoong Lee, Viswanath Nagarajan, Lily Wang

The -Supplier problem is an important location problem that has been actively studied in both general and Euclidean metrics. Many of its variants have also been studied, primari…

cs.DS2021★ 1 cited

Non-Adaptive Stochastic Score Classification and Explainable Halfspace Evaluation

Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan

Sequential testing problems involve a complex system with several components, each of which is "working" with some independent probability. The outcome of each component can be det…

cs.DS2021

The Power of Adaptivity for Stochastic Submodular Cover

Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan

In the stochastic submodular cover problem, the goal is to select a subset of stochastic items of minimum expected cost to cover a submodular function. Solutions in this setting co…

cs.DS2020

Online Generalized Network Design Under (Dis)Economies of Scale

Viswanath Nagarajan, Lily Wang

We consider a general online network design problem where a sequence of N requests arrive over time, each of which needs to use some subset of the available resources E. The cost i…

cs.DS2020★ 1 cited

Stochastic Makespan Minimization in Structured Set Systems

Anupam Gupta, Amit Kumar, Viswanath Nagarajan +1

We study stochastic combinatorial optimization problems where the objective is to minimize the expected maximum load (a.k.a.\ the makespan). In this framework, we have a set of …