DWDavid P. Williamson
David P. Williamson
*This is an algorithmically generated author record based on publicly available information.
David P. Williamson has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Michel X. Goemans
Massachusetts Institute of Technology
3 shared publications - Harold N. Gabow
Department of Computer Science, University of Colorado at Boulder, Boulder, USA
1 shared publication - Milena Mihail
Bellcore, Morristown, USA
1 shared publication - Ramamoorthi Ravi
Tepper School of Business, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213
1 shared publication - Vijay V. Vazirani
Computer Science and Engineering Department, Indian Institute of Technology, New Delhi, India
1 shared publication
Latest Publications
- 1 June 1998
- Published by Springer Nature in Mathematical Programming
- Vol. 82 (1-2) , 13-40
An efficient approximation algorithm for the survivable network design problem
- 1 June 1998
- Published by Springer Nature in Mathematical Programming
- Vol. 82 (1-2) , 13-40
An efficient approximation algorithm for the survivable network design problem
- 1 January 1998
- Published by Springer Nature in Combinatorica
- Vol. 18 (1) , 37-59
Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs
- 1 January 1998
- Published by Springer Nature in Combinatorica
- Vol. 18 (1) , 37-59
Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs
- 1 May 1997
- Published by Springer Nature in Algorithmica
- Vol. 18 (1) , 21-43
An approximation algorithm for minimum-cost vertex-connectivity problems
- 1 May 1997
- Published by Springer Nature in Algorithmica
- Vol. 18 (1) , 21-43
An approximation algorithm for minimum-cost vertex-connectivity problems
- 1 January 1997
- Published by Springer Nature
- p. 1
Gadgets, approximation, and linear programming: Improved hardness results for cut and satisfiability problems
- 1 January 1997
- Published by Springer Nature
- p. 1
Gadgets, approximation, and linear programming: Improved hardness results for cut and satisfiability problems
- 1 September 1995
- Published by Springer Nature in Combinatorica
- Vol. 15 (3) , 435-454
A primal-dual approximation algorithm for generalized steiner network problems
- 1 September 1995
- Published by Springer Nature in Combinatorica
- Vol. 15 (3) , 435-454
A primal-dual approximation algorithm for generalized steiner network problems