117 citations · 273 across the 35 of their papers we have counts for
3 papers · 1 filter
Thresholded Covering Algorithms for Robust and Max-Min Optimization
Anupam Gupta, Viswanath Nagarajan, R. Ravi
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should…
On k-Column Sparse Packing Programs
Nikhil Bansal, Nitish Korula, Viswanath Nagarajan +1
We consider the class of packing integer programs (PIPs) that are column sparse, i.e. there is a specified upper bound k on the number of constraints that each variable appears in.…
Non-monotone submodular maximization under matroid and knapsack constraints
Jon Lee, Vahab Mirrokni, Viswanath Nagarjan +1
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hyp…