Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New.
Condition: New.
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition.
Seller: Chiron Media, Wallingford, United Kingdom
US$ 65.86
Quantity: 10 available
Add to basketPaperback. Condition: New.
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 364.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
US$ 69.28
Quantity: Over 20 available
Add to basketCondition: New.
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. 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.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
US$ 76.79
Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. pp. 364.
Language: English
Published by Springer Berlin Heidelberg, 1998
ISBN 10: 3540642013 ISBN 13: 9783540642015
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: 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.
Taschenbuch. Condition: 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.
Language: English
Published by Springer Berlin Heidelberg Feb 1998, 1998
ISBN 10: 3540642013 ISBN 13: 9783540642015
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: 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.
Language: English
Published by Springer Berlin Heidelberg, 1998
ISBN 10: 3540642013 ISBN 13: 9783540642015
Seller: moluna, Greven, Germany
Condition: 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.
Language: English
Published by Springer Berlin Heidelberg, Springer Berlin Heidelberg Feb 1998, 1998
ISBN 10: 3540642013 ISBN 13: 9783540642015
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Taschenbuch. Condition: 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 GmbH, Tiergartenstr. 17, 69121 Heidelberg 364 pp. Englisch.