Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results, and conveys the beauty and excitement of work in the field. He gives clear, lucid explanations of key results and ideas, with intuitive proofs, and provides critical examples and numerous illustrations to help elucidate the algorithms. Many of the results presented have been simplified and new insights provided. Of interest to theoretical computer scientists, operations researchers, and discrete mathematicians.This book covers the dominant theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems.
|Author||:||Vijay V. Vazirani|
|Publisher||:||Springer Science & Business Media - 2002-12-05|