Publications

9 results at SODA 2009

A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between
- - Serge Gaspers
  - Gregory B. Sorkin
- 2009
- SODA 2009
How hard is it to approximate the best Nash equilibrium?
- - Elad Hazan
  - Robert Krauthgamer
- 2009
- SODA 2009
On the maximum quadratic assignment problem
- - Viswanath Nagarajan
  - Maxim Sviridenko
- 2009
- SODA 2009
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
Sequential cavity method for computing limits of the log-partition function for lattice models
- - David Gamarnik
  - Dmitriy Katz
- 2009
- SODA 2009
Speed scaling with an arbitrary power function
- - Nikhil Bansal
  - Ho-Leung Chan
  - et al.
- 2009
- SODA 2009
Better algorithms for benign bandits
- - Elad Hazan
  - Satyen Kale
- 2009
- SODA 2009
Transitive-closure spanners
- - Arnab Bhattacharyya
  - Elena Grigorescu
  - et al.
- 2009
- SODA 2009