Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques: 4th International Workshop on Approximation Algorithms for Combinatorial ... 2001 (Lecture Notes in Computer Science) | 
 enlarge | Creators: Michel Goemans, Klaus Jansen, Jose D.p. Rolim, Luca Trevisan
Publisher: Springer
Category: Book
List Price: $69.95
Buy New: $69.25
You Save: $0.70 (1%)
New (11) Used (6) from $25.00
Sales Rank: 6557717
Media: Paperback
Edition: 1
Pages: 297
Number Of Items: 1
Shipping Weight (lbs): 1
Dimensions (in): 9.2 x 6.1 x 0.7
ISBN: 3540424709
Dewey Decimal Number: 004.015114
EAN: 9783540424703
Publication Date: September 21, 2001
Availability: Usually ships in 1-2 business days
Shipping: Expedited shipping available
Shipping: International shipping available
Condition: New American book. Printed on demand and shipped within the US in 4-7 days (expedited) or about 10-14 days (standard). Standard can occasionally be slower so we advise using expedited if quicker delivery is important!
| |
| Editorial Reviews:
Product Description
This book constitutes the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Ranomization and Approximation Techniques in Computer Science, RANDOM 2001, held in Berkeley, California, USA in August 2001. The 26 revised full papers presented were carefully reviewed and selected from a total of 54 submissions. Among the issues addressed are design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization, de-randomization, average-case analysis, approximation classes, randomized complexity theory, scheduling, routing, coloring, partitioning, packing, covering, computational geometry, network design, and applications in various fields.
|
|
|
