Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
- Lisa Fleischer
- Kamal Jain
- et al.
- 2006
- Journal of Computer and System Sciences
Publications
Date
Featured collections
Popular topics
29 results for David P. Williamson
Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation
- Fabián A. Chudak
- Tim Roughgarden
- et al.
- 2004
- Mathematical Programming
Approximation algorithms for Max-3-Cut and other problems via complex semidefinite programming
- Michel X. Goemans
- David P. Williamson
- 2004
- Journal of Computer and System Sciences
Searching the workplace web
- Ronald Fagin
- Ravi Kumar
- et al.
- 2003
- WWW 2003
A primal-dual schema based approximation algorithm for the element connectivity problem
- Kamal Jain
- Ion Mǎndoiu
- et al.
- 2002
- Journal of Algorithms
The primal-dual method for approximation algorithms
- David P. Williamson
- 2002
- Mathematical Programming, Series B
Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems
- R. Ravi
- David P. Williamson
- 2002
- SODA 2002
Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems
- R. Ravi
- D.P. Williamson
- 2002
- Algorithmica (New York)
Improved approximation algorithms for MAX SAT
- Takao Asano
- David P. Williamson
- 2002
- Journal of Algorithms
Adversarial queuing theory
- Allan Borodin
- Jon Kleinberg
- et al.
- 2001
- Journal of the ACM