Running errands in time: Approximation algorithms for stochastic orienteering
- Anupam Gupta
- Ravishankar Krishnaswamy
- et al.
- 2015
- Mathematics of Operations Research
Paper
Publications
11 results for Anupam Gupta
Approximating sparse covering integer programs online
- Anupam Gupta
- Viswanath Nagarajan
- 2014
- Mathematics of Operations Research
PaperPrivately releasing conjunctions and the statistical Quer y Barrier
- Anupam Gupta
- Moritz Hardt
- et al.
- 2013
- SIAM Journal on Computing
PaperThresholded covering algorithms for robust and max-min optimization
- Anupam Gupta
- Viswanath Nagarajan
- et al.
- 2013
- Mathematical Programming
PaperApproximation algorithms for stochastic orienteering
- Anupam Gupta
- Ravishankar Krishnaswamy
- et al.
- 2012
- SODA 2012
Conference paperApproximation algorithms for VRP with stochastic demands
- Anupam Gupta
- Viswanath Nagarajan
- et al.
- 2012
- Operations Research
PaperWhen LP is the cure for your matching woes: Improved bounds for stochastic matchings
- Nikhil Bansal
- Anupam Gupta
- et al.
- 2011
- Algorithmica
PaperAn improved approximation algorithm for requirement cut
- Anupam Gupta
- Viswanath Nagarajan
- et al.
- 2010
- Operations Research Letters
PaperDial a ride from k-forest
- Anupam Gupta
- Mohammadtaghi Hajiaghayi
- et al.
- 2010
- ACM Transactions on Algorithms
PaperA plant location guide for the unsure: Approximation algorithms for min-max location problems
- Barbara Anthony
- Vineet Goyal
- et al.
- 2010
- Mathematics of Operations Research
Paper