Approximation Algorithms For Combinatorial Optimization
Third International Workshop, Approx 2000, Saarbreucken, Germany, September 5-8, 2000, Proceedings
Editor: KlausJansen
Springer-Verlag Berlin And Heidelberg Gmbh & Co. Kg (Germany), 2000
Paperback, 284 pages
Size: 235x155 mm
ISBN: 9783540679967
ISBN-10: 3540679960
Approximation Algorithms For Combinatorial Optimization
The topics dealt with include design and analysis of approximation algorithms, inapproximibility results, randomization techniques, average-case analysis, scheduling problems, cuts and connectivity, packing and covering, geometric problems, network design, and various applications.

