Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design; to computer science problems in databases; to advertising issues in viral marketing. Yet most such problems are NP-hard. Thus unless P = NP, there are no efficient algorithms to find optimal solutions to such problems. This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. The book is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization. Each chapter in the first part of the book is devoted to a single algorithmic technique, which is then applied to several different problems. The second part revisits the techniques but offers more sophisticated treatments of them. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithms courses, the book will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems.

Book Description:

Designed as a textbook for graduate courses on algorithms, this book will also serve as a reference for researchers who are interested in heuristic solutions of discrete optimization problems. It presents central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization.

"About this title" may belong to another edition of this title.

Store Description

GreatBookPrices.com is your top source for finding new books at the absolute lowest prices, guaranteed ! We offer big discounts - everyday - on millions of titles in virtually any category, from Architecture to Zoology -- and everything in between. Discover great deals and super-savings, on professional books, text book titles, the newest computer guides, or your favorite fiction authors. You'll find it all - at HUGE SAVINGS - at GreatBookPrices. Browse through our complete online product catalog today. Serving customers around the world for years, we help thousands find just the books they're looking for -- at incredibly low, bargain prices.

Visit Seller's Storefront

Seller's business information

Far Corner Europe Limited
19-20 Bourne Court, 19-20 Bourne Court, Woodford Green, IG8 8HD, United Kingdom

Terms of Sale:

Company Name: GreatBookPricesUK
Legal Entity: Far Corner Europe Limited
Address: 19-20 Bourne Court, Southend Road, Woodford Green Essex, UK IG8 8HD
Registration #: 10691061
Authorized representative: Danielle Hainsey

Shipping Terms:

Our warehouses across the globe are fully operational without substantial delays. We are working hard and continue to overcome the daily challenges presented by COVID-19. There have been reports that delivery carriers are experiencing large delays resulting in longer than normal deliveries to customers. See USPS's website for further detail. We would like to apologize in advance if your item arrives later than the expected delivery due date.

Internal processing of your order will take about 1-2 business days. Please allow an additional 4-14 business days for Media Mail delivery. We have multiple ship-from locations - MD,IL,NJ,UK,IN,NV,TN & GA

Payment Methods
accepted by seller

Add to Wants

Items related to Design of Approximation Algorithms

Design of Approximation Algorithms

Williamson, David P.; Shmoys, David B.

New - Hardcover

Seller's business information