Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques - 8th International Workshop on Approximation Algorithms for Compinatorial Optimization Problems, APPROX 2005 and 9th International Workshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings (Paperback, 2005 ed.)

This volume contains the papers presented at the 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2005) and the 9th International Workshop on Randomization and Computation(RANDOM2005), whichtookplaceconcurrentlyattheUniversity of California in Berkeley, on August 22-24, 2005. APPROX focuses on algori- mic and complexity issues surrounding the development of e?cient approximate solutions to computationally hard problems, and APPROX 2005 was the eighth in the series after Aalborg (1998), Berkeley (1999), Saarbru ]cken (2000), Ber- ley (2001), Rome (2002), Princeton(2003), and Cambridge(2004).RANDOM is concerned with applications of randomness to computational and combinatorial problems, and RANDOM 2005 was the ninth workshop in the series foll- ing Bologna (1997), Barcelona (1998), Berkeley(1999), Geneva (2000), Berkeley (2001), Harvard (2002), Princeton (2003), and Cambridge (2004). Topics of interest for APPROX and RANDOM are: design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, mathematical programming methods, coloring and partitioning, cuts and connectivity, geometric problems, game theory and applications, network designandrouting, packingand covering, scheduling, designandanalysisofr- domized algorithms, randomized complexity theory, pseudorandomness and - randomization, random combinatorialstructures, randomwalks/Markovchains, expander graphs and randomness extractors, probabilistic proof systems, r- dom projections and embeddings, error-correcting codes, average-case analysis, property testing, computational learning theory, and other applications of - proximation and randomness. The volume contains 20 contributed papers selected by the APPROX P- gram Committee out of 50 submissions, and 21 contributed papers selected by the RANDOM Program Committee out of 51 submis

General

Imprint:	Springer-Verlag
Country of origin:	Germany
Series:	Lecture Notes in Computer Science, 3624
Release date:	August 2005
First published:	2005
Editors:	Chandra Chekuri • Klaus Jansen • Jose D.P. Rolim • Luca Trevisan
Dimensions:	235 x 155 x 26mm (L x W x T)
Format:	Paperback
Pages:	495
Edition:	2005 ed.
ISBN-13:	978-3-540-28239-6
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Books > Computing & IT > General theory of computing > Mathematical theory of computation Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures Books > Science & Mathematics > Mathematics > Calculus & mathematical analysis > Vector & tensor analysis
LSN:	3-540-28239-4
Barcode:	9783540282396

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!