APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION by Chandra Chekuri (Editor), Klaus Jansen (Editor), Jose D. P. Rolim (Editor) ( 9783540282396 )

Item Details

Title:

APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION
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

By:

Chandra Chekuri (Editor), Klaus Jansen (Editor), Jose D. P. Rolim (Editor)

Format:

Paperback

List price:	£90.00
We currently do not stock this item, please contact the publisher directly for further information.

ISBN 10:

3540282394

ISBN 13:

9783540282396

Publisher:

SPRINGER-VERLAG BERLIN AND HEIDELBERG GMBH & CO. KG

Pub. date:

8 August, 2005

Series:

Lecture Notes in Computer Science / Theoretical Computer Science and General v.3624

Pages:

506

Description:

Contains 41 reviewed papers, selected by the two program committees from a total of 101 submissions. Among the issues addressed 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, and more.

Synopsis:

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 submissions.

Illustrations:

biography

Publication:

Germany

Imprint:

Springer-Verlag Berlin and Heidelberg GmbH & Co. K

Returns:

Returnable

Some other items by this author:

ALGORITHMIC ASPECTS OF WIRELESS SENSOR NETWORKS (PB)

APPROXIMATION ALGORITHMS FOR COMBINATORIAL OPTIMIZATION (PB)