Approximation Algorithms for NP-Hard Problems Dorit Hochbaum
Publisher: Course Technology

If one can establish a problem as NP-complete, there is strong reason to believe that it is intractable. The expected value of a discrete random variable). The field of "Sparse Approximation" deals with ways to perform atom decomposition, namely finding the atoms building the data vector. Product Description This is the first book to fully address the study of approximation algorithms as a tool for coping with intractable problems. The problem is NP hard for all non-trivial values of k and d and there are various approximation algorithms for solving this problem. Optimization/approximation algorithms/polynomial time/ NP-HARD. For graduate-level courses in approximation algorithms. It assumes familiarity with algorithms, mathematical proofs about the correctness of algorithms, probability theory and NP-completeness. We would then do better by trying to design a good approximation algorithm rather than searching endlessly seeking an exact solution. Finally, we assume that the reader knows something about NP-completeness, at least enough to know that there might be good reason for wanting fast, approximate solutions to NP-hard discrete optimization problems.