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 Hungarian Post 1 795 Ft Hungarian Post 1 690 Ft Hungarian Post 1 690 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft DPD point 990 Ft GLS courier 1 690 Ft GLS point 1 190 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 and Online Algorithms

Name: Approximation and Online Algorithms
Brand: Springer, Berlin
SKU: 01569867
Price: 19766 HUF
Availability: InStock
Author: Christos Kaklamanis
ISBN: 9783540779179

5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007, Revised Papers

Christos Kaklamanis

Martin Skutella

Language

English

Book Paperback

Libristo code: 01569867

Publishers Springer, Berlin, November 2007

This book constitutes the thoroughly refereed post workshop proceedings of the 5th International Wor... Full description

Libristo code: 01569867

136 b

19 766 Ft

In stock at our supplier Shipping in 5-8 days

Up to 30 days for returns

Customers also purchased

Kellerwirtschaft Robert Steidl

Paperback

14 629 Ft

Snadný Tarot Barbara Moore

Cards

3 392 Ft

This book constitutes the thoroughly refereed post workshop proceedings of the 5th International Workshop on Approximation and Online Algorithms, WAOA 2007, held in Eilat, Israel, in October 2007 as part of the ALGO 2007 conference event.§The 22 revised full papers presented were carefully reviewed and selected from 56 submissions. The workshop covered areas such as algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real-world applications, and scheduling problems.