Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques. 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA,USA, August 18-20, 2001.

Goemans, Michel et al. (Eds.)

ISBN 10: 3540424709 / ISBN 13: 9783540424703

Edité par Berlin, Springer., 2001

A propos de cet article

IX, 296 p. Softcover. Versand aus Deutschland / We dispatch from Germany via Air Mail. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. Lecture Notes in Computer Science, Vol. 2129. Sprache: Englisch.

N° de réf. du vendeur 651EB

Détails bibliographiques

• Titre: Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques. 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA,USA, August 18-20, 2001.
• Éditeur: Berlin, Springer.
• Date de parution: 2001
• Langue: anglais
• ISBN à 10 chiffres: 3540424709
• ISBN à 13 chiffres: 9783540424703
• Reliure: Couverture souple
• Catalogues du vendeur:
  • Informatik

A propos de ce titre

Synopsis

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.