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 Algorithms for Combinatorial Optimization

Name: Approximation Algorithms for Combinatorial Optimization
Brand: Springer, Berlin
SKU: 01567600
Price: 51.75 EUR
Availability: InStock
Author: Klaus Jansen
ISBN: 9783540679967

Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings

Klaus Jansen

Samir Khuller

Language

English

Book Paperback

Libristo code: 01567600

Publishers Springer, Berlin, November 1999

This book constitutes the refereed proceedings of the Third International Workshop on Approximation... Full description

Libristo code: 01567600

125 b

51.75 €

In stock at our supplier Shipping in 5-8 days

30-day return policy

Customers also purchased

Histoire de l'Eglise. Tome 1 (Ed.1703-1723) Francois Timoleon De Choisy

Paperback

33.21 €

Introducción a la energía eólica INNOVACION Y CUALIFICACION

Paperback

25.11 €

CURAR CON LA FUERZA DE LA NATURALEZA PETRA THORBRIETZ

Paperback

21.26 €

Louis Couperin (Suites) Rinaldo Alessandrini

Audio CD

16.90 €

Physikalisch modifizierte Stärke Konrad Treppe

Paperback

60.56 €

Sinistros em Terminais Petroliferos na America Latina Claudio Antonio Garcia

Paperback

44.55 €

Veselé pohádky z muzikantské zahrádky Marie Kubátová

Hardback

4.04 €

Entwurf und Implementierung eines Analyse-Tools zur statistischen Auswertung von E-Learning-Aktivitaten Marcel Minke

Paperback

42.83 €

This book constitutes the refereed proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2000, held in Saarbrücken, Germany in September 2000. The 22 revised full papers presented together with four invited contributions were carefully reviewed and selected from 68 submissions. The topics dealt with include design and analysis of approximation algorithms, inapproximibility results, on-line problems, randomization techniques, average-case analysis, approximation classes, scheduling problems, routing and flow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, and various applications.