- 5 Results
Lowest price: € 48.45, highest price: € 93.83, average price: € 59.53
1
Lectures on Proof Verification and Approximation Algorithms - Ernst W. Mayr
Order
at booklooker.de
€ 53.49
Shipment: € 0.001
Order
Provider details
Sponsored link
Ernst W. Mayr:

Lectures on Proof Verification and Approximation Algorithms - Paperback

2025, ISBN: 9783540642015

[ED: Taschenbuch], [PU: Springer Berlin Heidelberg], Neuware - During the last few years, we have seen quite spectacular progress in the area of approximation algorithms: for several fund… More...

Shipping costs:Sans frais d'envoi. (EUR 0.00) AHA-BUCH GmbH
close (x)
2
Lectures on Proof Verification and Approximation Algorithms - Ernst W. Mayr; Hans Jürgen Prömel; Angelika Steger
Order
at Springer.com
€ 53.49
Shipment: € 0.001
Order
Provider details
Sponsored link

Ernst W. Mayr; Hans Jürgen Prömel; Angelika Steger:

Lectures on Proof Verification and Approximation Algorithms - new book

ISBN: 9783540642015

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 upp… More...

Nr. 978-3-540-64201-5. Shipping costs:Worldwide free shipping, , DE. (EUR 0.00)
close (x)
3
Lectures on Proof Verification and Approximation Algorithms - Mayr, Ernst W. (Herausgeber); Steger, Angelika (Herausgeber); Prömel, Hans Jürgen (Herausgeber)
Order
at Achtung-Buecher.de
€ 57.66
Shipment: € 0.001
Order
Provider details
Sponsored link
Mayr, Ernst W. (Herausgeber); Steger, Angelika (Herausgeber); Prömel, Hans Jürgen (Herausgeber):
Lectures on Proof Verification and Approximation Algorithms - new book

1998

ISBN: 3540642013

1998 Kartoniert / Broschiert Algorithmus, EDV / Theorie / Informatik / Mathematik, Kombinatorik, Mathematik, Variationsrechnung, Diskrete Mathematik, Optimierung, Algorithmen und Datens… More...

Shipping costs:Versandkostenfrei innerhalb der BRD. (EUR 0.00) MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien
close (x)
4
Lectures on Proof Verification and Approximation Algorithms - Mayr, Ernst W. (Herausgeber); Steger, Angelika (Herausgeber); Prömel, Hans Jürgen (Herausgeber)
Order
at Achtung-Buecher.de
€ 57.66
Shipment: € 0.001
Order
Provider details
Sponsored link
Mayr, Ernst W. (Herausgeber); Steger, Angelika (Herausgeber); Prömel, Hans Jürgen (Herausgeber):
Lectures on Proof Verification and Approximation Algorithms - new book

1998, ISBN: 3540642013

1998 Kartoniert / Broschiert Algorithmus, EDV / Theorie / Informatik / Mathematik, Kombinatorik, Mathematik, Variationsrechnung, Diskrete Mathematik, Optimierung, Algorithmen und Datens… More...

Shipping costs:Versandkostenfrei innerhalb der BRD. (EUR 0.00) MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien
close (x)
5
Order
at alibris.co.uk
€ 61.83
Order
Details & Shipping
Sponsored link
Mayr, Ernst W (Editor), and Prömel, Hans Jürgen (Editor), and Steger, Angelika (Editor):
Lectures on Proof Verification and Approximation Algorithms - Paperback

1998, ISBN: 9783540642015

Trade paperback, Fine., Trade paperback (US). Glued binding. 348 p. Lecture Notes in Computer Science, 1367. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 … More...

Shipping costs:plus shipping costs Castle Donington, Derbyshire, GreatBookPricesUK5
close (x)
1As some platforms do not transmit shipping conditions to us and these may depend on the country of delivery, the purchase price, the weight and size of the item, a possible membership of the platform, a direct delivery by the platform or via a third-party provider (Marketplace), etc., it is possible that the shipping costs indicated by find-more-books.com / find-more-books.com do not correspond to those of the offering platform.

Bibliographic data of the best matching book

Details of the book
Lectures on Proof Verification and Approximation Algorithms
Author:
Title:
ISBN:

9783540642015


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.

Details of the book - Lectures on Proof Verification and Approximation Algorithms


EAN (ISBN-13): 9783540642015
ISBN (ISBN-10): 3540642013
Hardcover
Paperback
Publishing year: 2007
Publisher: Springer Berlin Heidelberg
364 Pages
Weight: 0,550 kg
Language: eng/Englisch

Book in our database since 2007-04-15T13:02:38-04:00 (New York)
Book found last time on 2025-02-20T13:45:28-05:00 (New York)
ISBN/EAN: 9783540642015

ISBN - alternate spelling:
3-540-64201-3, 978-3-540-64201-5
Alternate spelling and related search-keywords:
Book author: hans ernst, steger hans, mayr hans, jürgen ernst, angelika steger, ernst may, ernst angel, hans much, ernst ber, tutorial books
Book title: algorithms, proof verification, lectures the will know, approximation, lecture notes computer science, steger hans

Information from Publisher

Author: Ernst W. Mayr; Hans Jürgen Prömel; Angelika Steger
Title: Lecture Notes in Computer Science; Lectures on Proof Verification and Approximation Algorithms
Publisher: Springer; Springer Berlin
348 Pages
Publishing year: 1998-02-25
Berlin; Heidelberg; DE
Language: English
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XII, 348 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; algorithm; algorithms; approximation algorithms; complexity; complexity theory; optimization; programming; proof verification; randomized computation; verification; algorithm analysis and problem complexity; combinatorics; Theory of Computation; Algorithms; Discrete Mathematics in Computer Science; Discrete Mathematics; Calculus of Variations and Optimization; Algorithmen und Datenstrukturen; Mathematik für Informatiker; Diskrete Mathematik; Optimierung; EA

to the theory of complexity and approximation algorithms.- to randomized algorithms.- Derandomization.- Proof checking and non-approximability.- Proving the PCP-Theorem.- Parallel repetition of MIP(2,1) systems.- Bounds for approximating MaxLinEq3-2 and MaxEkSat.- Deriving non-approximability results by reductions.- Optimal non-approximability of MaxClique.- The hardness of approximating set cover.- Semidefinite programming and its applications to approximation algorithms.- Dense instances of hard optimization problems.- Polynomial time approximation schemes for geometric optimization problems in euclidean metric spaces.
This book coherently summarizes the spectacular progress achieved in the areas of approximation algorithms and combinatorial optimization during the last few years. Includes supplementary material: sn.pub/extras
< to archive...