Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

DPD courier 4.99 € GLS courier 11.49 €

Contact

How to shop

Help

My account

▸ Empty :-(

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Name: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Brand: Springer, Berlin
SKU: 01562955
Price: 58.4 EUR
Availability: InStock
Author: Sanjeev Arora
ISBN: 9783540407706

6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Sci

Language

English

Book Paperback

Libristo code: 01562955

Publishers Springer, Berlin, November 2002

This book constitutes the joint refereed proceedings of the 6th International Workshop on Approximat... Full description

Libristo code: 01562955

141 b

58.40 €

Low in stock at our supplier Shipping in 13-18 days

30-day return policy

Customers also purchased

TU NOMBRE EN UN POEMA BATISTE BASTIDAS

Paperback

15.55 €

Co se děje kolem nás Anne Suessová

Board book

9.08 €

Allegro con fuoco DOMINGUEZ

Paperback

13.13 €

Club prive La Cabana - breve racconto erotico Salt

MP3

3.93 €

Walks with an alien - Steven Lesney

Paperback

19.90 €

Zanna bianca Jack London

Hardback

20.50 €

BASES DEL CUIDADO INFANTIL Y ADOLESCENTE (ENFERMERIA DEL NIÑO Y DEL ADOLESCENTE, VOL. 5) CRESPO

Book

95.08 €

Achterbahn Klaus-Dieter Schmidt

Paperback

19.90 €

Tagebuch der Reise in die Niederlande Albrecht Dürer

Paperback

13.73 €

Le Barbier de Seville, Ou La Precaution Inutile: Opera-Comique En 4 Actes Castil-Blaze

Paperback

13.63 €

Ein diskretes Wunder Isabel Allende

Paperback

5.65 €

This book constitutes the joint refereed proceedings of the 6th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2003 and of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, held in Princeton, NY, USA in August 2003.§The 33 revised full papers presented were carefully reviewed and selected from 74 submissions. Among the issues addressed are design and analysis of randomized and approximation algorithms, online algorithms, complexity theory, combinatorial structures, error-correcting codes, pseudorandomness, derandomization, network algorithms, random walks, Markov chains, probabilistic proof systems, computational learning, randomness in cryptography, and various applications.