Title
The Design of Approximation Algorithms,New
Processing time: 1-3 days
US Orders Ships in: 3-5 days
International Orders Ships in: 8-12 days
Return Policy: 15-days return on defective items
Payment Option
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 NPhard. 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 nearoptimal 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 graduatelevel algorithms courses, the book will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems.
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.
For more information, please visit www.P65Warnings.ca.gov.
- Q: What topics are covered in 'The Design of Approximation Algorithms'? A: The book covers discrete optimization problems, algorithmic techniques for designing approximation algorithms, greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization.
- Q: Who is the author of this book? A: 'The Design of Approximation Algorithms' is authored by David P. Williamson.
- Q: What is the primary audience for this book? A: This book is designed as a textbook for graduate-level algorithms courses and also serves as a reference for researchers interested in heuristic solutions for discrete optimization problems.
- Q: What is the publication date of this book? A: The book was published on April 26, 2011.
- Q: How many pages does 'The Design of Approximation Algorithms' have? A: The book contains 518 pages.
- Q: Is the book available in different formats? A: Yes, 'The Design of Approximation Algorithms' is available in hardcover format.
- Q: What is the condition of the book? A: The book is in new condition.
- Q: Does the book include exercises or problems for practice? A: Yes, the book includes various problems related to the algorithmic techniques discussed in each chapter.
- Q: Is prior knowledge of algorithms required to understand this book? A: While some background in algorithms may be helpful, the book is structured to guide readers through the concepts effectively.
- Q: What makes this book unique compared to other algorithm textbooks? A: This book uniquely focuses on approximation algorithms and includes methods for proving that optimization problems are hard to approximate.