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

This Festschrift is in honor of Ker-I Ko, Professor in the Stony Brook University, USA. Ker-I Ko was one of the founding fathers of computational complexity ove

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,