The Design of Approximation Algorithms - Info and Reading Options
By David P. Williamson and David B. Shmoys
"The Design of Approximation Algorithms" was published by Cambridge University Press in 2011 - New York, it has 504 pages and the language of the book is English.
“The Design of Approximation Algorithms” Metadata:
- Title: ➤ The Design of Approximation Algorithms
- Authors: David P. WilliamsonDavid B. Shmoys
- Language: English
- Number of Pages: 504
- Publisher: Cambridge University Press
- Publish Date: 2011
- Publish Location: New York
“The Design of Approximation Algorithms” Subjects and Themes:
Edition Specifications:
- Format: Hardcover
- Pagination: xi, 504 p. :
Edition Identifiers:
- The Open Library ID: OL24917486M - OL16013950W
- Online Computer Library Center (OCLC) ID: 671709856
- Library of Congress Control Number (LCCN): 2011001945
- ISBN-13: 9780521195270
- ISBN-10: 0521195276
- All ISBNs: 0521195276 - 9780521195270
AI-generated Review of “The Design of Approximation Algorithms”:
"The Design of Approximation Algorithms" Description:
The Open Library:
"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"--
Read “The Design of Approximation Algorithms”:
Read “The Design of Approximation Algorithms” by choosing from the options below.
Search for “The Design of Approximation Algorithms” downloads:
Visit our Downloads Search page to see if downloads are available.
Borrow "The Design of Approximation Algorithms" Online:
Check on the availability of online borrowing. Please note that online borrowing has copyright-based limitations and that the quality of ebooks may vary.
- Is Online Borrowing Available: Yes
- Preview Status: full
- Check if available: The Open Library & The Internet Archive
Find “The Design of Approximation Algorithms” in Libraries Near You:
Read or borrow “The Design of Approximation Algorithms” from your local library.
- The WorldCat Libraries Catalog: Find a copy of “The Design of Approximation Algorithms” at a library near you.
Buy “The Design of Approximation Algorithms” online:
Shop for “The Design of Approximation Algorithms” on popular online marketplaces.
- Ebay: New and used books.