Mon premier blog

Approximation Algorithms for NP-Hard Problems by Dorit Hochbaum

Approximation Algorithms for NP-Hard Problems Dorit Hochbaum ebook
Format: djvu
ISBN: 0534949681, 9780534949686
Publisher: Course Technology
Page: 620

Think about all the effort that's gone into finding approximation algorithms and hardness of approximation results for NP-complete problems. When an NP-complete problem must be solved, one approach is to use a polynomial algorithm to approximate the solution; the answer thus obtained will not necessarily be optimal but will be reasonably close. Heuristics for NP-hard problems. The theory of NP-completeness suggests that some problems in CS are inherently hard—that is, there is likely no possible algorithm that can efficiently solve them. Yet most such problems are NP-hard. A less obvious application is that the minimum spanning tree can be used to approximately solve the traveling salesman problem. Approximation algorithms for NP-hard problems. In this problem, multiple missions compete for sensor resources. They showed that this problem is NP-hard even to approximate, and presented several heuristic algorithms. Thus unless P = NP, there are no efficient algorithms to find optimal solutions to such problems. €� traveling salesperson problem, Steiner tree.