Optimizing against a randomizing adversary. Approximation algorithms for facility location problems. Maximizing job benefits on-line. Wavelength rerouting in optical networks, or the Venetian routing problem.
Greedy approximation algorithms for finding dense components in a graph.
On the relative complexity of approximate counting problems. On the hardness of approximating N P witnesses. New results for online page replication. Inapproximability results for set splitting and satisfiability problems with no mixed clauses. Approximation algorithms for a capacitated network design problem.