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

Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results,

Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design

This book is dedicated to Jack Edmonds in appreciation of his ground breaking work that laid the foundations for a broad variety of subsequent results achieved

This book documents the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimizati