Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

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

Free delivery for purchases over 19 990 Ft

DPD courier 1 190 Ft Post 1 795 Ft Post 1 690 Ft Post 1 690 Ft GLS point 1 390 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft DPD point 990 Ft GLS courier 1 790 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Approximation Algorithms for Combinatorial Optimization

Name: Approximation Algorithms for Combinatorial Optimization
Brand: Springer, Berlin
SKU: 01567600
Price: 19902 HUF
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

136 b

19 902 Ft

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

12 632 Ft

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

Paperback

8 883 Ft

CURAR CON LA FUERZA DE LA NATURALEZA PETRA THORBRIETZ

Paperback

7 534 Ft

Louis Couperin (Suites) Rinaldo Alessandrini

Audio CD

6 318 Ft

Physikalisch modifizierte Stärke Konrad Treppe

Paperback

23 465 Ft

Sinistros em Terminais Petroliferos na America Latina Claudio Antonio Garcia

Paperback

17 267 Ft

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

Hardback

1 511 Ft

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

Paperback

16 606 Ft

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.