• 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
Approximation Algorithms

Approximation Algorithms

Hardcover

General ComputersProgramming

ISBN10: 3540653678
ISBN13: 9783540653677
Publisher: Springer
Published: Jul 2 2001
Pages: 380
Weight: 1.55
Height: 1.08 Width: 6.42 Depth: 9.60
Language: English

Most natural optimization problems, including those arising in important application areas, are NP-hard. Therefore, under the widely believed conjecture that PNP, their exact solution is prohibitively time consuming. Charting the landscape of approximability of these problems, via polynomial-time algorithms, therefore becomes a compelling subject of scientific inquiry in computer science and mathematics. This book presents the theory of approximation algorithms.

1 different editions

Also available

Also from

Vazirani, Vijay V.

Also in

Programming