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


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.


R1,655

Or split into 4x interest-free payments of 25% on orders over R50
Learn more

Discovery Miles16550
Mobicred@R155pm x 12* Mobicred Info
Free Delivery
Delivery AdviceShips in 10 - 15 working days



Product Description

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.

Customer Reviews

No reviews or ratings yet - be the first to create one!

Product Details

General

Imprint

Springer-Verlag

Country of origin

Germany

Series

Lecture Notes in Computer Science, 4110

Release date

August 2006

Availability

Expected to ship within 10 - 15 working days

First published

2006

Editors

, , ,

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

Barcode

9783540380443

Categories

LSN

3-540-38044-2



Trending On Loot