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

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

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 well-written textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast

This book constitutes the refereed proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2