Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design
Designed as a textbook for graduate courses on algorithms, this book presents efficient algorithms that find provably near-optimal solutions.
Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results,
This book is intended to be used as a textbook for graduate students studying theoretical computer science. It can also be used as a reference book for research
This is the first book to fully address the study of approximation algorithms as a tool for coping with intractable problems. With chapters contributed by leadi
