Additive guarantees for degree bounded directed network design
- Nikhil Bansal
- Rohit Khandekar
- et al.
- 2008
- STOC 2008
Publications
Date
Featured collections
Popular topics
32 results for Viswanath Nagarajan
The Euclidean k-supplier problem
- Viswanath Nagarajan
- Baruch Schieber
- et al.
- 2020
- Mathematics of Operations Research
Malleable scheduling for flows of jobs and applications to MapReduce
- Viswanath Nagarajan
- Joel Wolf
- et al.
- 2018
- Journal of Scheduling
Facility location with matroid or knapsack constraints
- Ravishankar Krishnaswamy
- Amit Kumar
- et al.
- 2015
- Mathematics of Operations Research
Running errands in time: Approximation algorithms for stochastic orienteering
- Anupam Gupta
- Ravishankar Krishnaswamy
- et al.
- 2015
- Mathematics of Operations Research
Minimum congestion mapping in a cloud
- Nikhil Bansal
- Kang-Won Lee
- et al.
- 2015
- SIAM Journal on Computing
Approximating sparse covering integer programs online
- Anupam Gupta
- Viswanath Nagarajan
- 2014
- Mathematics of Operations Research
Min-max graph partitioning and small set expansion
- Nikhil Bansal
- Uriel Feige
- et al.
- 2014
- SIAM Journal on Computing
Thresholded covering algorithms for robust and max-min optimization
- Anupam Gupta
- Viswanath Nagarajan
- et al.
- 2013
- Mathematical Programming
On generalizations of network design problems with degree bounds
- Nikhil Bansal
- Rohit Khandekar
- et al.
- 2012
- Mathematical Programming