Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Lectures on Proof Verification and Approximation Algorithms

Lectures on Proof Verification and Approximation Algorithms

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

Paperback

Series: Lecture Notes in Computer Science, Book 1367

FictionGeneral ComputersProgramming

ISBN10: 3540642013
ISBN13: 9783540642015
Publisher: Springer
Published: Feb 25 1998
Pages: 348
Weight: 1.10
Height: 0.80 Width: 6.32 Depth: 9.44
Language: English
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.

Also from

Mayr, Ernst W.

View All

Also in

Fiction

View All