Approximation Algorithms for NP-Hard Problems

Edited by Dorit S. Hochbaum

Published July 1996

Words from the Editor/Author

Numerous practical problems are integer optimization problems that are intractable. Such problems are commonly addressed with heuristics that provide a solution, but not information on the solution's quality. The approximation algorithms' framework provides a guarantee on the quality of the solution obtained. This framework has been used as a guide to developing algorithms in specific problem areas with increasingly improved performance. The book describes the state-of-the-art algorithms in each specialized area and reviews the most effective technical tools used. The thirteen chapters of the book are written by leading researchers that have contributed to the state of the art of approximation algorithms.

About the book

  • Table of Contents

  • Errata

    Approximation Algorithms for NP-Hard Problems
    Edited by Dorit S. Hochbaum
    Address: Department of Industrial Engineering
    Operations Research, Etcheverry Hall
    University of California, Berkeley, CA 94720-1777
    "Copyright 1997, PWS Publishing Company, Boston, MA. This material may not be copied, reproduced, or distributed in any form without permission from the publisher."

    Back to Hochbaum main page