Mon premier blog

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

Finally we prove that the general problem is NP-hard, and that the existence of a constant-factor-approximation algorithm is unlikely. For these problems, approximation algorithms are good choices. Think about all the effort that's gone into finding approximation algorithms and hardness of approximation results for NP-complete problems. Perhaps, the best source on approximation algorithms. NP-hard and NP-complete problems, basic concepts, non- deterministic algorithms, NP-hard and NP-complete, decision and optimization problems, graph based problems on NP Principle, Computational Geometry, Approximation algorithm. Backtracking basic strategy, 8-Queen's problem, graph colouring, Hamiltonian cycles etc, Approximation algorithm and concepts based on approximation algorithms. Approximation Algorithm for NP-hard problems by Dorit Hochbaum is a set of chapters by different contributors. Here is an example to give a feeling. Presented at Computer Science Department, Sharif University of Technology (Optimization Seminar ). The field of "Sparse Approximation" deals with ways to perform atom decomposition, namely finding the atoms building the data vector. Also the bottleneck variant of the problem is shown to be solvable in polynomial time. I also wanted to include just a little bit of my own opinion on why studying approximation algorithms is worthwhile. As we know, NP-hard problems are nightmare for the computers. The problem is NP-hard and an approximation algorithm has been described in the reference.