Publications

32 results for Viswanath Nagarajan

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
Approximation algorithms for stochastic orienteering
- - Anupam Gupta
  - Ravishankar Krishnaswamy
  - et al.
- 2012
- SODA 2012
Approximation algorithms for VRP with stochastic demands
- - Anupam Gupta
  - Viswanath Nagarajan
  - et al.
- 2012
- Operations Research
Min-max graph partitioning and small set expansion
- - Nikhil Bansal
  - Uriel Feige
  - et al.
- 2011
- FOCS 2011
Minimum congestion mapping in a cloud
- - Nikhil Bansal
  - Kang-Won Lee
  - et al.
- 2011
- PODC 2011
When LP is the cure for your matching woes: Improved bounds for stochastic matchings
- - Nikhil Bansal
  - Anupam Gupta
  - et al.
- 2011
- Algorithmica
The directed orienteering problem
- - Viswanath Nagarajan
  - R. Ravi
- 2011
- Algorithmica (New York)
Approximation algorithms for distance constrained vehicle routing problems
- - Viswanath Nagarajan
  - R. Ravi
- 2011
- Networks