0
Your cart

Your cart is empty

Books > Computing & IT > Computer programming

Buy Now

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30, 2006, Proceedings (Paperback, 2006 ed.) Loot Price: R1,538
Discovery Miles 15 380
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 9th International Workshop on...

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30, 2006, Proceedings (Paperback, 2006 ed.)

Josep Diaz, Klaus Jansen, Jose D.P. Rolim, Uri Zwick

Series: Lecture Notes in Computer Science, 4110

 (sign in to rate)
Loot Price R1,538 Discovery Miles 15 380 | Repayment Terms: R144 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

Donate to Against Period Poverty

This book constitutes the joint refereed proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and the 10th International Workshop on Randomization and Computation, RANDOM 2006, held in Barcelona, Spain, in August 2006.

The 44 revised full papers presented were carefully reviewed and selected from 105 submissions. Among the topics covered are design and analysis of approximation algorithms, hardness of approximation problems, small spaces and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, mathematical programming methods, coloring and partitioning, cuts and connectivity, game theory, network design and routing, packing and covering, scheduling, design and analysis of randomized algorithms, randomized complexity theory, pseudorandomness, derandomization, random combinatorial structures, Markov chains, prohabalistic proof systems, error-correcting codes, etc.

General

Imprint: Springer-Verlag
Country of origin: Germany
Series: Lecture Notes in Computer Science, 4110
Release date: August 2006
First published: 2006
Editors: Josep Diaz • Klaus Jansen • Jose D.P. Rolim • Uri Zwick
Dimensions: 235 x 155 x 27mm (L x W x T)
Format: Paperback
Pages: 522
Edition: 2006 ed.
ISBN-13: 978-3-540-38044-3
Categories: Books > Computing & IT > Computer programming > General
LSN: 3-540-38044-2
Barcode: 9783540380443

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!

Partners