Regularity lemmas and combinatorial algorithms
- Nikhil Bansal
- Ryan Williams
- 2009
- FOCS 2009
Publications
This is our catalog of publications authored by IBM researchers, in collaboration with the global research community. It’s an ever-growing body of work that shows why IBM is one of the most important contributors to modern computing.
Date
Featured collections
Popular topics
60 results for Nikhil Bansal
Weighted flow time does not admit O(1)-competitive algorithms
- Nikhil Bansal
- Ho-Leung Chan
- 2009
- SODA 2009
A logarithmic approximation for unsplittable flow on line graphs
- Nikhil Bansal
- Zachary Friggstad
- et al.
- 2009
- SODA 2009
Speed scaling with an arbitrary power function
- Nikhil Bansal
- Ho-Leung Chan
- et al.
- 2009
- SODA 2009
Randomized competitive algorithms for generalized caching
- Nikhil Bansal
- Niv Buchbinder
- et al.
- 2008
- STOC 2008
Additive guarantees for degree bounded directed network design
- Nikhil Bansal
- Rohit Khandekar
- et al.
- 2008
- STOC 2008
Non-preemptive min-sum scheduling with resource augmentation
- Nikhil Bansal
- Ho-Leung Chan
- et al.
- 2007
- FOCS 2007
A primal-dual randomized algorithm for weighted paging
- Nikhil Bansal
- Niv Buchbinder
- et al.
- 2007
- FOCS 2007
Harmonic algorithm for 3-dimensional strip packing problem
- Nikhil Bansal
- Xin Han
- et al.
- 2007
- SODA 2007
Dynamic pricing for impatient bidders
- Nikhil Bansal
- Ning Chen
- et al.
- 2007
- SODA 2007