3. APPROX 2000:
Dorit S. Hochbaum
: Instant recognition of polynominal time solvability, half integrality and 2-approximations.
Rolf H. Möhring
: Scheduling under uncertainty: Optimizing against a randomizing adversary.
David B. Shmoys
: Approximation algorithms for facility location problems.
: Greedy approximation algorithms for finding dense components in a graph.
: Inapproximability results for set splitting and satisfiability problems with no mixed clauses.