Book review: Approximation Algorithms for NP-hard Problems. Edited by Dorit S. Hochbaum (PWS, 1997).
Randeep BhatiaYoram J. SussmannPublished in: SIGACT News (1998)
Keyphrases
- approximation algorithms
- np hard problems
- np hard
- scheduling problem
- np complete
- knapsack problem
- special case
- minimum cost
- lower bound
- integer programming
- approximation ratio
- worst case
- linear programming
- optimal solution
- vertex cover
- constraint programming
- randomized algorithms
- disjoint paths
- constant factor approximation
- constant factor
- graph coloring
- branch and bound algorithm
- combinatorial search
- polynomial time approximation
- upper bound
- computational complexity