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 focuses on the development of approximation-related algorithms and their relevant applications. Individual contributions are written by leading expert

New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.

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

Techniques and principles of minimax theory play a key role in many areas of research, including game theory, optimization, and computational complexity. In gen