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: 05274846
Price: 19870 HUF
Availability: InStock
Author: Klaus Jansen
ISBN: 9783540647362

International Workshop APPROX '98, Aalborg, Denmark, July 18-19, 1998, Proceedings

Klaus Jansen

Jose Rolim

Language

English

Book Paperback

Libristo code: 05274846

Publishers Springer, Berlin, November 1997

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

Libristo code: 05274846

136 b

19 870 Ft

In stock at our supplier Shipping in 5-8 days

30-day return policy

Customers also purchased

Turnaround Management Fur Mittelstandische Unternehmen Jan P. Clasen

Paperback

20 004 Ft

Una isla llamada Utopía Martínez Hulin

Paperback

10 419 Ft

Die Bezahlung und Versorgung von Politikern und Managern Hans Herbert von Arnim

Paperback

17 092 Ft

Ọ̀rẹ́ Timọ́timọ́ Ozioma Osanu

Hardback

9 570 Ft

LES ARTISTES ET L'AFFAIRE DREYFUS (1898-1908) Bertrand TILLIER Book

Paperback

13 271 Ft

Replanteo de Instalaciones Solares térmicas (MF0601_2). Montaje y mantenimiento de Instalaciones Sol

Paperback

10 973 Ft

Survivor Marcus Ingendaay

Paperback

5 971 Ft

This book constitutes the refereed proceedings of the International Workshop on Approximation Algorithms for Combinatorical Optimization, APPROX'98, held in conjunction with ICALP'98 in Aalborg, Denmark, in July 1998.The volume presents 14 revised full papers together with three invited papers selected from 37 submissions. The papers address the design and analysis of approximation algorithms, inapproximability 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.