| Approximation Algorithms for Combinatorial Optimization: International Workshop Approx'98, Aalborg, Denmark, July 18-19, 1998, Proceedings 1998 Edition Contributor(s): Jansen, Klaus (Editor), Rolim, Jose (Editor) |
|
 |
ISBN: 3540647368 ISBN-13: 9783540647362 Publisher: Springer OUR PRICE: $52.24 Product Type: Paperback - Other Formats Published: July 1998 Annotation: This book constitutes the refereed proceedings of the International Workshop on Approximation Algorithms for Combinatorical Optimization, APPROX'98, held in conjunction with ICALP'98 in Aalborg, Denmark, in July 1998. The volume presents 14 revised full papers together with three invited papers selected from 37 submissions. The papers address the design and analysis of approximation algorithms, inapproximability 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. |
| Additional Information |
| BISAC Categories: - Computers | Programming - Algorithms - Computers | Computer Science - Mathematics | Discrete Mathematics |
| Dewey: 005.1 |
| LCCN: 98034217 |
| Series: Lecture Notes in Computer Science |
| Physical Information: 0.46" H x 6.14" W x 9.21" (0.68 lbs) 207 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: This book constitutes the refereed proceedings of the International Workshop on Approximation Algorithms for Combinatorical Optimization, APPROX'98, held in conjunction with ICALP'98 in Aalborg, Denmark, in July 1998. The volume presents 14 revised full papers together with three invited papers selected from 37 submissions. The papers address the design and analysis of approximation algorithms, inapproximability 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. |