David P. Williamson

Publications
Influence

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

M. Goemans, David P. Williamson
Mathematics, Computer Science
JACM
1 November 1995

We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least. Expand

3,255
499
PDF

A general approximation technique for constrained forest problems

M. Goemans, David P. Williamson
Computer Science, Mathematics
SODA '92
1 September 1992

We present a general approximation technique for a large class of graph problems, including the shortest path, minimum spanning tree, minimum-weight perfect matching, traveling salesman and Steiner tree problems. Expand

The Design of Approximation Algorithms

David P. Williamson, D. Shmoys
Mathematics, Computer Science
26 April 2011

Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design; to computer science problems in databases; to advertising issues in viral marketing . Expand

.879-approximation algorithms for MAX CUT and MAX 2SAT

M. Goemans, David P. Williamson
Mathematics, Computer Science
STOC '94
23 May 1994

We present randomized approximation algorithms for the MAX CUT and MAX 2SAT problems that always deliver solutions of expected value at least .87856 times the optimal value. Expand

New 3/4-Approximation Algorithms for the Maximum Satisfiability Problem

M. Goemans, David P. Williamson
Mathematics, Computer Science
SIAM J. Discret. Math.
1 November 1994

Yannakakis recently presented the first $\frac{3}{4}$-approximation algorithm for the Maximum Satisfiability Problem (MAX SAT). Expand

The primal-dual method for approximation algorithms and its application to network design problems

M. Goemans, David P. Williamson
Computer Science
1 August 1996

In the last four decades, combinatorial optimization has been strongly influenced by linear programming. Expand

Adversarial queueing theory

A. Borodin, J. Kleinberg, P. Raghavan, M. Sudan, David P. Williamson
Computer Science
STOC '96
1 July 1996

We introduce a new approach to the study of dynamic (or continuous) packet routing, where packets are being continuously injected into a network. Expand

Adversarial queuing theory

A. Borodin, J. Kleinberg, P. Raghavan, M. Sudan, David P. Williamson
Mathematics, Computer Science
JACM
2001

We develop an adversarial theory of queuing aimed at addressing some of the restrictions inherent in probabilistic analysis and queuing theory based on time-invariant stochastic generation. Expand

The Approximability of Constraint Satisfaction Problems

S. Khanna, M. Sudan, L. Trevisan, David P. Williamson
Mathematics, Computer Science
SIAM J. Comput.
1 December 2001

We study optimization problems that may be expressed as "Boolean constraint satisfaction problems." An instance of a Boolean constraint satisfaction problem is given by m constraints applied to n Boolean variables. Expand

Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems

Lisa Fleischer, K. Jain, David P. Williamson
Computer Science, Mathematics
J. Comput. Syst. Sci.
1 August 2006

The survivable network design problem (SNDP) is the following problem: given an undirected graph and values rij for each pair of vertices i and j, find a minimum-cost subgraph such that there are at least rij disjoint paths between verticesi and j. Expand

Recommended Authors