The book is currently out of stock
Parameters
- 404 pages
- 15 hours of reading
More about the book
Focusing on the theory of approximation algorithms, this book explores the landscape of NP-hard optimization problems and their polynomial time solutions. It is divided into three parts, with the first addressing combinatorial algorithms for various significant issues, employing diverse design techniques. The authors intentionally avoid rigid categorizations to reflect the complexity of NP-hard problems, emphasizing the unique characteristics of each problem while highlighting connections between different algorithms and challenges in the field.
Book purchase
Approximation Algorithms, Vijay V. Vazirani
- Language
- Released
- 2010
- product-detail.submit-box.info.binding
- (Paperback)
We’ll email you as soon as we track it down.
Payment methods
We’re missing your review here.
- Language
- English
- Authors
- Vijay V. Vazirani
- Publisher
- Springer Berlin Heidelberg
- Released
- 2010
- Format
- Paperback
- Pages
- 404
- ISBN13
- 9783642084690
- Series
- Tags
- Non-Fiction, Textbooks, Technology & Engineering, References & Manuals, Computers & Internet, Technology, Math Textbooks, Algorithms
- Rating
- 4.2 out of 5
- Description
- Focusing on the theory of approximation algorithms, this book explores the landscape of NP-hard optimization problems and their polynomial time solutions. It is divided into three parts, with the first addressing combinatorial algorithms for various significant issues, employing diverse design techniques. The authors intentionally avoid rigid categorizations to reflect the complexity of NP-hard problems, emphasizing the unique characteristics of each problem while highlighting connections between different algorithms and challenges in the field.