Enlarge cover

# Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

This book documents the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimization problems. The wealth of problems, algorithms, results, and techniques make it an indispensible source of reference for professionals. The text smoothly integrates numerous illustrations, examples, and exercises.

Hardcover, 543 pages

Published
February 1st 2003
by Springer

## Friend Reviews

To see what your friends thought of this book,
please sign up.

This book is not yet featured on Listopia.
Add this book to your favorite list »

## Community Reviews

(showing
1-12
of
12)

There are no discussion topics on this book yet.
Be the first to start one »