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. $47.79, good condition, Sold by GreatBookPricesUK5 rated 5.0 out of 5 stars, ships from Castle Donington, DERBYSHIRE, UNITED KINGDOM, published 2010 by Springer-Verlag Berlin and Heidelberg GmbH & Co. K.
Edition:
2010, Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Publisher:
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Published:
2010
Language:
English
Alibris ID:
18221243355
Shipping Options:
Standard Shipping: $4.94
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. XIX, 380 p. Intended for professional and scholarly audience. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers.
Add this copy of Approximation Algorithms to cart. $66.42, new condition, Sold by GreatBookPricesUK5 rated 5.0 out of 5 stars, ships from Castle Donington, DERBYSHIRE, UNITED KINGDOM, published 2010 by Springer-Verlag Berlin and Heidelberg GmbH & Co. K.
Edition:
2010, Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Publisher:
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Published:
2010
Language:
English
Alibris ID:
17911700494
Shipping Options:
Standard Shipping: $4.94
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. XIX, 380 p. Intended for professional and scholarly audience. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Add this copy of Approximation Algorithms to cart. $66.42, like new condition, Sold by GreatBookPricesUK5 rated 5.0 out of 5 stars, ships from Castle Donington, DERBYSHIRE, UNITED KINGDOM, published 2010 by Springer-Verlag Berlin and Heidelberg GmbH & Co. K.
Edition:
2010, Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Publisher:
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Published:
2010
Language:
English
Alibris ID:
17911521580
Shipping Options:
Standard Shipping: $4.94
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Fine. XIX, 380 p. Intended for professional and scholarly audience. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Add this copy of Approximation Algorithms to cart. $68.02, new condition, Sold by Ria Christie Books rated 4.0 out of 5 stars, ships from Uxbridge, MIDDLESEX, UNITED KINGDOM, published 2010 by Springer-Verlag Berlin and Heidelberg GmbH & Co. K.
Edition:
2010, Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Add this copy of Approximation Algorithms to cart. $43.73, like new condition, Sold by Zebras Books rated 5.0 out of 5 stars, ships from Somerset, NJ, UNITED STATES, published 2010 by Springer-Verlag Berlin and Heidelberg GmbH & Co. K.
Edition:
2010, Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Add this copy of Approximation Algorithms to cart. $43.73, very good condition, Sold by Zebras Books rated 5.0 out of 5 stars, ships from Somerset, NJ, UNITED STATES, published 2010 by Springer-Verlag Berlin and Heidelberg GmbH & Co. K.
Edition:
2010, Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Add this copy of Approximation Algorithms to cart. $43.74, good condition, Sold by Seattle Goodwill rated 5.0 out of 5 stars, ships from Seattle, WA, UNITED STATES, published 2010 by Springer-Verlag Berlin and Heidelberg GmbH & Co. K.
Edition:
2010, Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Publisher:
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Published:
2010
Language:
English
Alibris ID:
18332687552
Shipping Options:
Standard Shipping: $4.94
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
May have some shelf-wear due to normal use. Your purchase funds free job training and education in the greater Seattle area. Thank you for supporting Goodwill's nonprofit mission!
Add this copy of Approximation Algorithms to cart. $46.09, very good condition, Sold by BooksRun rated 5.0 out of 5 stars, ships from Philadelphia, PA, UNITED STATES, published 2010 by Springer.
Edition:
2010, Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Add this copy of Approximation Algorithms to cart. $46.82, good condition, Sold by SurplusTextSeller rated 5.0 out of 5 stars, ships from Columbia, MO, UNITED STATES, published 2010 by Springer-Verlag Berlin and Heidelberg GmbH & Co. K.
Edition:
2010, Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Publisher:
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Published:
2010
Language:
English
Alibris ID:
18345001506
Shipping Options:
Standard Shipping: $4.94
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).
Add this copy of Approximation Algorithms to cart. $49.04, new condition, Sold by Warriors SG rated 5.0 out of 5 stars, ships from Somerset, NJ, UNITED STATES, published 2010 by Springer-Verlag Berlin and Heidelberg GmbH & Co. K.
Edition:
2010, Springer-Verlag Berlin and Heidelberg GmbH & Co. K
