Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques

Michel Goemans

ISBN 10: 3540424709 / ISBN 13: 9783540424703

Verlag: Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE, 2001

Beschreibung

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.

Bestandsnummer des Verkäufers LU-9783540424703

Bibliografische Details

• Titel: Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
• Verlag: Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE
• Erscheinungsjahr: 2001
• Sprache: Englisch
• ISBN-10: 3540424709
• ISBN-13: 9783540424703
• Einband: Paperback
• Auflage: 2001 ed.
• Zustand: New

Über diesen Titel

Inhaltsangabe

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.