Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Anupam Gupta

ISBN 10: 3642325114 / ISBN 13: 9783642325113

Published by Springer Berlin Heidelberg, Springer Berlin Heidelberg Jul 2012, 2012

About this Item

This item is printed on demand - Print on Demand Titel. Neuware -This book constitutes the joint refereed proceedings of the 15th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2012, and the 16th International Workshop on Randomization and Computation, RANDOM 2012, held in Cambridge, Massachusetts, USA, in August 2011.The volume contains 28 contributed papers, selected by the APPROX Program Committee out of 70 submissions, and 28 contributed papers, selected by the RANDOM Program Committee out of 67 submissions.APPROX focuses on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM is concerned with applications of randomness to computational and combinatorial problems.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 692 pp. Englisch.

Seller Inventory # 9783642325113

Bibliographic Details

• Title: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Publisher: Springer Berlin Heidelberg, Springer Berlin Heidelberg Jul 2012
• Publication Date: 2012
• Language: English
• ISBN 10: 3642325114
• ISBN 13: 9783642325113
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 37D millimeters 235 millimeters width by 155 millimeters height by 37 millimeters depth
• Weight: 1031 grams

About this title

Synopsis

This book constitutes the joint refereed proceedings of the 15th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2012, and the 16th International Workshop on Randomization and Computation, RANDOM 2012, held in Cambridge, Massachusetts, USA, in August 2011. The volume contains 28 contributed papers, selected by the APPROX Program Committee out of 70 submissions, and 28 contributed papers, selected by the RANDOM Program Committee out of 67 submissions. APPROX focuses on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM is concerned with applications of randomness to computational and combinatorial problems.