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 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

Paradigms for Fast Parallel Approximability

Name: Paradigms for Fast Parallel Approximability
Brand: Cambridge University Press
SKU: 02030664
Price: 21578 HUF
Availability: PreOrder
Author: Josep DíazMaria SernaPaul SpirakisJacobo Torán
ISBN: 9780521431705

Josep DíazMaria SernaPaul SpirakisJacobo Torán

Language

English

Book Hardback

Libristo code: 02030664

Publishers Cambridge University Press, July 1997

Various problems in computer science are 'hard', that is NP-complete, and so not realistically compu... Full description

Libristo code: 02030664

147 b

Coming soon

21 578 Ft

Reprint

Date unknown

30-day return policy

Customers also purchased

Die Kreativität des Handelns Hans Joas

Paperback

8 411 Ft

Secret Warriors

Paperback

35 524 Ft

Nedráždi bráchu bosou nohou Irena Hejdová

Hardback

5 081 Ft

Grandes vacances du souriceau (Les) Doray malika

Board book

5 304 Ft

Cahier de coloriage Jean Cocteau Jean Cocteau

Hardback

5 977 Ft

Príprava do škôlky Matematika Yusuke Yonezu

Paperback

1 825 Ft

Der Graf von Monte Christo Alexandre

Paperback

7 700 Ft

Docència i pràctica del dret romà Obarrio Moreno

Paperback

5 406 Ft

Tardes d'estiu Torres

Paperback

2 754 Ft

Karty andělů Melanie Missing

Cards

5 889 Ft

Diario de un vacío EMI YAGI

Paperback

7 570 Ft

CANDY - SHOU HARUSONO ART COLLECTION Harusono

Paperback

22 548 Ft

Lékařský slang a úsloví Antonín Doležal

Sheet

1 927 Ft

CreActivity Branding: Poetiche e Storia della CreAttivit? dal Rinascimento ad oggi Stefano Donno

Paperback

3 065 Ft

El dia que se perdio el amor / The Day Love Was Lost Javier Castillo

Paperback

4 626 Ft

Kto je Wilhelm? Constance Ørbeck-Nilssen

Hardback

3 195 Ft

TOTS ELS CONTES DEL MÓN ARO SAINZ DE LA MAZA

Hardback

9 015 Ft

Paratges naturals: Massís del Garraf i conques de l'Anoia, del Foix i del Gaià XAVIER BAYER

Hardback

5 480 Ft

Hallo Berlin, Ici Paris - Die Darstellung der Kommunikation Patrick Barth

Paperback

6 302 Ft

Karl der Grosse und die Mauren Robert Schneider

Paperback

6 302 Ft

Kommission der Vereinten Nationen fur Friedenskonsolidierung Andreas Bonner

Paperback

6 302 Ft

Neue Ansätze der MittelstandsForschung Joachim Merz

Paperback

14 416 Ft

Manfred und Elke Rotraut S. Berner

Board book

2 592 Ft

Rubens im Blick. Ausgewählte Werke unter Revision Eveliina Juntunen

Paperback

9 177 Ft

Various problems in computer science are 'hard', that is NP-complete, and so not realistically computable; thus in order to solve them they have to be approximated. This book is a survey of the basic techniques for approximating combinatorial problems using parallel algorithms. Its core is a collection of techniques that can be used to provide parallel approximations for a wide range of problems (for example, flows, coverings, matchings, travelling salesman problems, graphs), but in order to make the book reasonably self-contained, the authors provide an introductory chapter containing the basic definitions and results. A final chapter deals with problems that cannot be approximated, and the book is ended by an appendix that gives a convenient summary of the problems described in the book. This is an up-to-date reference for research workers in the area of algorithms, but it can also be used for graduate courses in the subject.