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.
An approximation algorithm for the fault tolerant metric facility location problem. Approximating node connectivity problems via set covers. On the inapproximability of broadcasting time.