Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques : 11th International Workshop, Approx 2008 and 12th International Workshop, Random 2008, Boston, Ma, Usa, August 25-27, 2008

Walmart # 559704994

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques : 11th International Workshop, Approx 2008 and 12th International Workshop, Random 2008, Boston, Ma, Usa, August 25-27, 2008

Walmart # 559704994
$165.12$165.12
Only 1 left!
Free 2-day shipping
Free pickup Wed, Sep 26
Sold & shipped byWalmart
Add to Registry
Approximation, Randomization, and Combinatorial Optimization

About This Item

We aim to show you accurate product information. Manufacturers, suppliers and others provide what you see here, and we have not verified it.
Approximation, Randomization, and Combinatorial Optimization This volume contains the papers presented at the 11th International Wo- shop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2008) and the 12th International Workshop on Randomization and Computation (RANDOM 2008), which took place concurrently at the MIT (M- sachusetts Institute of Technology) in Boston, USA, during August 25 27, 2008. APPROX focuses on algorithmic and complexity issues surrounding the development of e?cient approximate solutions to computationally di?cult problems, and was the 11th in the series after Aalborg (1998), Berkeley (1999), Saarbru ]cken (2000), Berkeley (2001), Rome (2002), Princeton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), and Princeton (2007). RANDOM is concerned with applications of randomness to computational and combinatorial problems, and was the 12th workshop in the series following Bologna (1997), Barcelona (1998), Berkeley (1999), Geneva (2000), Berkeley (2001), Harvard (2002), Princeton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), and Princeton (2007). Topics of interest for APPROX and RANDOM are: design and analysis of - proximation algorithms, hardness of approximation, small space, sub-linear time, streaming, algorithms, embeddings and metric space methods, mathematical programming methods, combinatorial problems in graphs and networks, game t- ory, markets, economic applications, geometric problems, packing, covering, scheduling, approximate learning, design and analysis of randomized algorithms, randomized complexity theory, pseudorandomness and derandomization, random combinatorial structures, random walks/Markov chains, expander graphs and randomness extractors, probabilistic proof systems, random projections and - beddings, error-correcting codes, average-case analysis, property testing, com- tational learning theory, and other applications of approximation and randomness."

Specifications

Series Title
Lecture Notes in Computer Science
Publisher
Springer
Book Format
Paperback / softback
Original Languages
English
Number of Pages
604
Author
Jansen, Klaus, Rolim, Jose D. P., Goel, Ashish
ISBN-13
9783540853626
Publication Date
October, 2008
Assembled Product Dimensions (L x W x H)
9.20 x 6.10 x 1.40 Inches
ISBN-10
3540853626
Customer Reviews
0 Reviews
Be the first to review this item!
Questions & Answers0 question
Get specific details about this product from customers who own it.

Policies & Plans

Gifting plans
Pricing policy
Returns

Gifting plans

Gift options are not available for this item.
Electrode, Comp-418947678, DC-prod-dfw7, ENV-prod-variation, PROF-PROD, VER-26.11.3, SHA-caf78d4cfe9bbb883d37bc5201e1a2753f80c8f0, CID-