Min-max graph partitioning and small set expansion
- Nikhil Bansal
- Uriel Feige
- et al.
- 2011
- FOCS 2011
Publications
Date
Featured collections
Popular topics
37 results for Joseph Naor
Towards the randomized k-server conjecture: A primal-dual approach
- Nikhil Bansal
- Niv Buchbinder
- et al.
- 2010
- SODA 2010
Randomized competitive algorithms for generalized caching
- Nikhil Bansal
- Niv Buchbinder
- et al.
- 2008
- STOC 2008
A primal-dual randomized algorithm for weighted paging
- Nikhil Bansal
- Niv Buchbinder
- et al.
- 2007
- FOCS 2007
Traffic engineering of management flows by link augmentations on confluent trees
- Randeep Bhatia
- Nicole Immorlica
- et al.
- 2005
- SPAA 2005
Approximating the average response time in broadcast scheduling
- Nikhil Bansal
- Moses Charikar
- et al.
- 2005
- SODA 2005
Throughput maximization of real-time scheduling with batching
- Amotz Bar-Noy
- Sudipto Guha
- et al.
- 2002
- SODA 2002
A unified approach to approximating resource allocation and scheduling
- Amotz Bar-Noy
- Reuven Bar-Yehuda
- et al.
- 2000
- STOC 2000
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
- Noga Alon
- Jehoshua Bruck
- et al.
- 1991
- ISIT 1991
Approximating minimum feedback sets and multicuts in directed graphs
- G. Even
- J. Naor
- et al.
- 1998
- Algorithmica (New York)