David P. Williamson

Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming

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 .87856 times the… (More)

A General Approximation Technique for Constrained Forest Problems

We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph with trees, cycles or… (More)

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

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. These algorithms use a… (More)

The Design of Approximation Algorithms

David P. Williamson, David B. Shmoys
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… (More)

The Approximability of Constraint Satisfaction Problems

Sanjeev Khanna, Madhu Sudan, Luca Trevisan, David P. Williamson
SIAM J. Comput.
2000

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… (More)

Adversarial Queueing Theory

Allan Borodin, Jon M. Kleinberg, Prabhakar Raghavan, Madhu Sudan, David P. Williamson
STOC
1996

is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for… (More)

Faster approximation algorithms for the minimum latency problem

In this paper, we give a 9.28-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of… (More)

Improved approximation algorithms for MAX SAT

MAX SAT (the maximum s~tisfiability problem) is stated as follows: given a set of clauses with weights, find a truth assignment that maximizes the sum of the weights of the satisfied clauses. In this… (More)

Improved Approximation Algorithms for Network Design Problems

Michel X. Goemans, Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos, David P. Williamson
SODA
1994

We consider a class of network design problems in which one needs to nd a minimum-cost network satisfying certain connectivity requirements. For example, in the sur-vivable network design problem,… (More)

Scheduling Parallel Machines On-Line

David B. Shmoys, Joel Wein, David P. Williamson
FOCS
1991

Filter Results:

Publication Year

Publication Type

Co-author

Journals and Conferences