Combinatorial approximation algorithms: a comparative review

  • Authors:

  • Gerhard J. Woeginger

  • Affiliations:

  • Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands

  • Venue:
  • Operations Research Letters
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper is a comparative review of three related books: Giorgio Ausiello, Pierluigi Crescenzi, Giorgio Gambosi, Viggo Kann, Alberto Marchetti-Spaccamela, Marco Protasi, Complexity and Approximation (Combinatorial Optimization Problems and Their Approximability Properties), second printing, Springer, Berlin, 2003, ISBN 3-540-65431-3, 524 pp., @?53.45 (first printing 1999). Juraj Hromkovic, Algorithmics for Hard Problems (Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics), second edition, Springer, Berlin, 2003, ISBN 3-540-44134-4, 544 pp., @?53.45 (first printing 2001). Vijay Vazirani, Approximation Algorithms, second printing, Springer, Berlin, 2002, ISBN 3-540-65367-8, 380 pp., @?37.40 (first printing 2001).