Synopsis "approximation algorithms for combinatorial optimization"
this book constitutes the refereed proceedings of the third international workshop on approximation algorithms for combinatorial optimization problems, approx 2000, held in saarbrücken, germany in september 2000. the 22 revised full papers presented together with four invited contributions were carefully reviewed and selected from 68 submissions. the topics dealt with include design and analysis of approximation algorithms, inapproximibility results, on-line problems, randomization techniques, average-case analysis, approximation classes, scheduling problems, routing and flow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, and various applications.
