Approximation Algorithms for Combinatorial Optimization
Download or Read eBook Approximation Algorithms for Combinatorial Optimization PDF written by Klaus Jansen and published by Springer. This book was released on 2003-07-31 with total page 290 pages. Available in PDF, EPUB and Kindle.
| Author | : Klaus Jansen |
| Publisher | : Springer |
| Total Pages | : 290 |
| Release | : 2003-07-31 |
| ISBN-10 | : 9783540444367 |
| ISBN-13 | : 354044436X |
| Rating | : 4/5 (67 Downloads) |
Book Synopsis Approximation Algorithms for Combinatorial Optimization by : Klaus Jansen
Book excerpt: This book constitutes the refereed proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2000, held in Saarbrcken, 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.
