Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 12th International Workshop, APPROX 2009, and 13th ... 5687 (Lecture Notes in Computer Science) - Tapa blanda

 
9783642036842: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 12th International Workshop, APPROX 2009, and 13th ... 5687 (Lecture Notes in Computer Science)

Sinopsis

This volume contains the papers presented at the 12th International Wo- shop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2009) and the 13th International Workshop on Randomization and Computation (RANDOM 2009), which took place concurrently at the HP - ditorium in UC Berkeley, USA, during August 21-23, 2009. APPROX focuses on algorithmic and complexity issues surrounding the development of e?cient approximate solutions to computationally di?cult problems, and was the 12th in the series after Aalborg (1998), Berkeley (1999), Saarbru ¨cken (2000), Ber- ley (2001), Rome (2002), Princeton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), Princeton (2007), and Boston (2008). RANDOM is concerned with applications of randomness to computational and combinatorial problems, and was the 13th workshop in the series following Bologna (1997), Barcelona (1998),Berkeley(1999),Geneva(2000),Berkeley(2001),Harvard(2002),Prin- ton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), Princeton (2007), and Boston (2008). Topics of interest for APPROX and RANDOM are: design and analysis of approximation algorithms, hardness of approximation, small space algorithms, sub-linear time algorithms, streaming algorithms, embeddings and metric space methods,mathematicalprogrammingmethods,combinatorialproblemsingraphs andnetworks,gametheory,markets,andeconomicapplications,geometricpr- lems, packing, covering, scheduling, approximate learning, design and analysis of online algorithms, randomized complexity theory, pseudorandomness and - randomization,randomcombinatorialstructures, randomwalks/Markovchains, expander graphs and randomness extractors, probabilistic proof systems, err- correctingcodes,average-caseanalysis,propertytesting,computationallearning theory, and other applications of approximation and randomness. The volume contains 25 contributed papers, selected by the APPROX Program Committee out of 56 submissions, and 28 contributed papers, selected by the RANDOM Program Committee out of 57 submissions.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

This volume contains the papers presented at the 12th International Wo- shop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2009) and the 13th International Workshop on Randomization and Computation (RANDOM 2009), which took place concurrently at the HP - ditorium in UC Berkeley, USA, during August 21-23, 2009. APPROX focuses on algorithmic and complexity issues surrounding the development of e?cient approximate solutions to computationally di?cult problems, and was the 12th in the series after Aalborg (1998), Berkeley (1999), Saarbru ¨cken (2000), Ber- ley (2001), Rome (2002), Princeton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), Princeton (2007), and Boston (2008). RANDOM is concerned with applications of randomness to computational and combinatorial problems, and was the 13th workshop in the series following Bologna (1997), Barcelona (1998),Berkeley(1999),Geneva(2000),Berkeley(2001),Harvard(2002),Prin- ton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), Princeton (2007), and Boston (2008). Topics of interest for APPROX and RANDOM are: design and analysis of approximation algorithms, hardness of approximation, small space algorithms, sub-linear time algorithms, streaming algorithms, embeddings and metric space methods,mathematicalprogrammingmethods,combinatorialproblemsingraphs andnetworks,gametheory,markets,andeconomicapplications,geometricpr- lems, packing, covering, scheduling, approximate learning, design and analysis of online algorithms, randomized complexity theory, pseudorandomness and - randomization,randomcombinatorialstructures, randomwalks/Markovchains, expander graphs and randomness extractors, probabilistic proof systems, err- correctingcodes,average-caseanalysis,propertytesting,computationallearning theory, and other applications of approximation and randomness. The volume contains 25 contributed papers, selected by the APPROX Program Committee out of 56 submissions, and 28 contributed papers, selected by the RANDOM Program Committee out of 57 submissions.

Reseña del editor

This book constitutes the joint refereed proceedings of the 12th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2009, and the 13th International Workshop on Randomization and Computation, RANDOM 2009, held in Berkeley, CA, USA, in August 2009. The 25 revised full papers of the APPROX 2009 workshop and the 28 revised full papers of the RANDOM 2009 workshop included in this volume, were carefully reviewed and selected from 56 and 58 submissions, respectively. 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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Otras ediciones populares con el mismo título

9783642036866: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 12th International Workshop, APPROX 2009, and 13th ... CA, USA, August, 21-23, 2009, Proceedings

Edición Destacada

ISBN 10:  3642036864 ISBN 13:  9783642036866
Editorial: Springer, 2009
Tapa blanda