Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques: 11th International Workshop, Approx 2008 and 12th International Workshop, Random 2008, Boston, MA, USA, August 25-27, 2008,

Goel, Ashish (Editor)/ Jansen, Klaus (Editor)/ Rolim, Jose D. P. (Editor)/ Rubinfeld, Ronitt (Editor)

ISBN 10: 3540853626 / ISBN 13: 9783540853626

Published by Springer-Verlag New York Inc, 2008

About this Item

1st edition. 604 pages. 9.00x6.00x1.25 inches. In Stock.

Seller Inventory # x-3540853626

Bibliographic Details

• Title: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques: 11th International Workshop, Approx 2008 and 12th International Workshop, Random 2008, Boston, MA, USA, August 25-27, 2008,
• Publisher: Springer-Verlag New York Inc
• Publication Date: 2008
• Language: English
• ISBN 10: 3540853626
• ISBN 13: 9783540853626
• Binding: Paperback
• Condition: Brand New
• Weight: 0.94 kilograms

About this title

Synopsis

This volume contains the papers presented at the 11th International Wo- shop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2008) and the 12th International Workshop on Randomization and Computation (RANDOM 2008), which took place concurrently at the MIT (M- sachusetts Institute of Technology) in Boston, USA, during August 25–27, 2008. APPROX focuses on algorithmic and complexity issues surrounding the development of e?cient approximate solutions to computationally di?cult problems, and was the 11th in the series after Aalborg (1998), Berkeley (1999), Saarbru ¨cken (2000), Berkeley (2001), Rome (2002), Princeton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), and Princeton (2007). RANDOM is concerned with applications of randomness to computational and combinatorial problems, and was the 12th workshop in the series following Bologna (1997), Barcelona (1998), Berkeley (1999), Geneva (2000), Berkeley (2001), Harvard (2002), Princeton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), and Princeton (2007). Topics of interest for APPROX and RANDOM are: design and analysis of - proximation algorithms, hardness of approximation, small space, sub-linear time, streaming, algorithms, embeddings and metric space methods, mathematical programming methods, combinatorial problems in graphs and networks, game t- ory, markets, economic applications, geometric problems, packing, covering, scheduling, approximate learning, design and analysis of randomized algorithms, randomized complexity theory, pseudorandomness and derandomization, random combinatorial structures, random walks/Markov chains, expander graphs and randomness extractors, probabilistic proof systems, random projections and - beddings, error-correcting codes,average-case analysis, property testing, com- tational learning theory, and other applications of approximation and randomness.

From the Back Cover

This book constitutes the joint refereed proceedings of the 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008 and the 12th International Workshop on Randomization and Computation, RANDOM 2008, held in Boston, MA, USA, in August 2008.

The 20 revised full papers of the APPROX 2008 workshop were carefully reviewed and selected from 42 submissions and focus on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM 2008 is concerned with applications of randomness to computational and combinatorial problems and accounts for 27 revised full papers, also diligently reviewed and selected out of 52 workshop submissions.