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. This book is divided into three parts. Part I covers ...
Read More
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. This book is divided into three parts. Part I covers combinatorial algorithms for a number of important problems, using a wide variety of algorithm design techniques. Part II presents linear programming based algorithms. These are categorized under two fundamental techniques: rounding and the primal-dual schema. Part III covers four important topics: the first is the problem of finding a shortest vector in a lattice; the second is the approximability of counting, as opposed to optimization, problems; the third topic is centered around recent breakthrough results, establishing hardness of approximation for many key problems, and giving new legitimacy to approximation algorithms as a deep theory; and the fourth topic consists of the numerous open problems of this young field. This book is suitable for use in advanced undergraduate and graduate-level courses on approximation algorithms. An undergraduate course in algorithms and the theory of NP-completeness should suffice as a prerequisite for most of the chapters. This book can also be used as supplementary text in basic undergraduate and graduate algorithms courses.
Read Less
Add this copy of Approximation Algorithms to cart. $28.16, fair condition, Sold by ThriftBooks-Reno rated 5.0 out of 5 stars, ships from Reno, NV, UNITED STATES, published by SPRINGER (SIE).
Add this copy of Approximation Algorithms to cart. $28.17, good condition, Sold by HPB-Red rated 5.0 out of 5 stars, ships from Dallas, TX, UNITED STATES, published 2013 by SPRINGER (SIE).
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
Add this copy of Approximation Algorithms to cart. $32.00, good condition, Sold by HPB-Red rated 5.0 out of 5 stars, ships from Dallas, TX, UNITED STATES, published 2001 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
Add this copy of Approximation Algorithms to cart. $32.50, fair condition, Sold by Midtown Scholar Bookstore rated 5.0 out of 5 stars, ships from Harrisburg, PA, UNITED STATES, published 2001 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Fair. Ex-library with usual stamps, stickers, and markings This is a damaged book. May be ex-library, water-damaged, or spine creased/broken. Acceptable, Reading copy only, with writing/markings and heavy wear. Standard-sized.
Add this copy of Approximation Algorithms to cart. $32.68, new condition, Sold by discount_scientific_books rated 5.0 out of 5 stars, ships from Sterling Heights, MI, UNITED STATES, published 2001 by Springer.
Add this copy of Approximation Algorithms to cart. $40.75, good condition, Sold by SurplusTextSeller rated 5.0 out of 5 stars, ships from Columbia, MO, UNITED STATES, published 2001 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes).
