BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × Greece
1 × Switzerland
3 × USA
Collaborated with:
M.X.Goemans M.Sudan J.M.Kleinberg J.Qian S.Khanna A.Aggarwal M.Mihail V.V.Vazirani A.Borodin P.Raghavan
Talks about:
algorithm (4) approxim (4) problem (4) max (3) cut (2) semidefinit (1) constraint (1) satisfact (1) constrain (1) adversari (1)

Person: David P. Williamson

DBLP DBLP: Williamson:David_P=

Contributed to:

ICALP (1) 20112011
STOC 20012001
STOC 19971997
STOC 19961996
STOC 19941994
STOC 19931993

Wrote 7 papers:

ICALP-v1-2011-QianW #algorithm #online #problem
An O(logn)-Competitive Algorithm for Online Constrained Forest Problems (JQ, DPW), pp. 37–48.
STOC-2001-GoemansW #algorithm #approximate #problem #programming
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (MXG, DPW), pp. 443–452.
STOC-1997-KhannaSW #classification #constraints #problem
A Complete Classification of the Approximability of Maximization Problems Derived from Boolean Constraint Satisfaction (SK, MS, DPW), pp. 11–20.
STOC-1996-AggarwalKW #layout #trade-off
Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout (AA, JMK, DPW), pp. 585–594.
Adversarial Queueing Theory (AB, JMK, PR, MS, DPW), pp. 376–385.
STOC-1994-GoemansW #algorithm #approximate #satisfiability
.879-approximation algorithms for MAX CUT and MAX 2SAT (MXG, DPW), pp. 422–431.
STOC-1993-WilliamsonGMV #algorithm #approximate #network #problem
A primal-dual approximation algorithm for generalized Steiner network problems (DPW, MXG, MM, VVV), pp. 708–717.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.