Minimum congestion mapping in a cloud
- Nikhil Bansal
- Kang-Won Lee
- et al.
- 2015
- SIAM Journal on Computing
Paper
Publications
60 results for Nikhil Bansal
A logarithmic approximation for unsplittable flow on line graphs
- Nikhil Bansal
- Zachary Friggstad
- et al.
- 2014
- ACM Transactions on Algorithms
PaperMin-max graph partitioning and small set expansion
- Nikhil Bansal
- Uriel Feige
- et al.
- 2014
- SIAM Journal on Computing
PaperOn generalizations of network design problems with degree bounds
- Nikhil Bansal
- Rohit Khandekar
- et al.
- 2012
- Mathematical Programming
PaperMin-max graph partitioning and small set expansion
- Nikhil Bansal
- Uriel Feige
- et al.
- 2011
- FOCS 2011
Conference paperA polylogarithmic-competitive algorithm for the k-server problem
- Nikhil Bansal
- Niv Buchbinder
- et al.
- 2011
- FOCS 2011
Conference paperMinimum congestion mapping in a cloud
- Nikhil Bansal
- Kang-Won Lee
- et al.
- 2011
- PODC 2011
Conference paperWhen LP is the cure for your matching woes: Improved bounds for stochastic matchings
- Nikhil Bansal
- Anupam Gupta
- et al.
- 2011
- Algorithmica
PaperThe geometry of scheduling
- Nikhil Bansal
- Kirk Pruhs
- 2010
- FOCS 2010
Conference paperConstructive algorithms for discrepancy minimization
- Nikhil Bansal
- 2010
- FOCS 2010
Conference paper