Approximation Algorithms for Combinatorial Optimization

A volume of 17 papers from a workshop on approximation algorithms for combinatorial optimization. They address the design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization techniques, average-case analysis, scheduling problems, and applications.