Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 58,70
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 59,54
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Chiron Media, Wallingford, Regno Unito
EUR 56,43
Quantità: 10 disponibili
Aggiungi al carrelloPaperback. Condizione: New.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 59,37
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 74,26
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 65,47
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Condizione: New. pp. 364.
EUR 53,49
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - During the last few years, we have seen quite spectacular progress in the area of approximation algorithms: for several fundamental optimization problems we now actually know matching upper and lower bounds for their approximability. This textbook-like tutorial is a coherent and essentially self-contained presentation of the enormous recent progress facilitated by the interplay between the theory of probabilistically checkable proofsand aproximation algorithms. The basic concepts, methods, and results are presented in a unified way to provide a smooth introduction for newcomers. These lectures are particularly useful for advanced courses or reading groups on the topic.
EUR 50,25
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Lectures on Proof Verification and Approximation Algorithms | Ernst W. Mayr (u. a.) | Taschenbuch | xii | Englisch | 1998 | Springer | EAN 9783540642015 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Lingua: Inglese
Editore: Springer Berlin Heidelberg Feb 1998, 1998
ISBN 10: 3540642013 ISBN 13: 9783540642015
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 53,49
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -During the last few years, we have seen quite spectacular progress in the area of approximation algorithms: for several fundamental optimization problems we now actually know matching upper and lower bounds for their approximability. This textbook-like tutorial is a coherent and essentially self-contained presentation of the enormous recent progress facilitated by the interplay between the theory of probabilistically checkable proofsand aproximation algorithms. The basic concepts, methods, and results are presented in a unified way to provide a smooth introduction for newcomers. These lectures are particularly useful for advanced courses or reading groups on the topic. 364 pp. Englisch.
Da: Majestic Books, Hounslow, Regno Unito
EUR 78,79
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand pp. 364 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 79,80
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND pp. 364.
Lingua: Inglese
Editore: Springer Berlin Heidelberg, 1998
ISBN 10: 3540642013 ISBN 13: 9783540642015
Da: moluna, Greven, Germania
EUR 48,37
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book coherently summarizes the spectacular progress achieved in the areas of approximation algorithms and combinatorial optimization during the last few years.This book coherently summarizes the spectacular progress achieved in the areas of appr.
Lingua: Inglese
Editore: Springer, Springer Feb 1998, 1998
ISBN 10: 3540642013 ISBN 13: 9783540642015
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 53,49
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -During the last few years, we have seen quite spectacular progress in the area of approximation algorithms: for several fundamental optimization problems we now actually know matching upper and lower bounds for their approximability. This textbook-like tutorial is a coherent and essentially self-contained presentation of the enormous recent progress facilitated by the interplay between the theory of probabilistically checkable proofs and aproximation algorithms. The basic concepts, methods, and results are presented in a unified way to provide a smooth introduction for newcomers. These lectures are particularly useful for advanced courses or reading groups on the topic.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 364 pp. Englisch.