Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013, Proceedings

Prasad Raghavendra (u. a.)

ISBN 10: 3642403271 / ISBN 13: 9783642403279

Published by Springer, 2013

About this Item

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013, Proceedings | Prasad Raghavendra (u. a.) | Taschenbuch | xiv | Englisch | 2013 | Springer | EAN 9783642403279 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Seller Inventory # 105718847

Bibliographic Details

• Title: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013, Proceedings
• Publisher: Springer
• Publication Date: 2013
• Language: English
• ISBN 10: 3642403271
• ISBN 13: 9783642403279
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 40D millimeters 235 millimeters width by 155 millimeters height by 40 millimeters depth
• Weight: 1089 grams
• Seller catalogs:
  • Bücher

About this title

Synopsis

This book constitutes the proceedings of the 16th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2013, and the 17th International Workshop on Randomization and Computation, RANDOM 2013, held in August 2013 in the USA. The total of 48 carefully reviewed and selected papers presented in this volume consist of 23 APPROX papers selected out of 46 submissions, and 25 RANDOM papers selected out of 52 submissions. APPROX 2013 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems, while RANDOM 2013 focuses on applications of randomness to computational and combinatorial problems.