Approximation Algorithms

Vazirani, Vijay V.

ISBN 10: 3540653678 / ISBN 13: 9783540653677

Edité par Springer, 2001

A propos de cet article

Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! N° de réf. du vendeur S_382205136

Détails bibliographiques

Titre : Approximation Algorithms

Éditeur : Springer

Date d'édition : 2001

Reliure : Hardcover

Etat : Good

A propos de ce titre

Synopsis :

Approximation Algorithms Covers theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems. This book contains useful algorithms and results about the intrinsic complexity of combinatorial problems. It is of interest to theoretical computer scientists, operations researchers, and discrete mathematicians. Full description

Présentation de l'éditeur:

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.