Mon premier blog

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

Abraham Flaxman | October 16, 2009 at 3:25 pm | Permalink. This book deals with designing polynomial time approximation algorithms for NP-hard optimization problems. It seems like there would be incentive to participate if players believed their approximation algorithm or embedding scheme could beat the next firm's. The authors give another, similarly artificial, example: Consider for example a . If one can establish a problem as NP-complete, there is strong reason to believe that it is intractable. Pricing such an instrument involves solving an NP-complete problem, but no one would argue that this implies anything about real financial instruments. Both these problems are NP-hard, which motivates our interest in their approximation. Problem classes P, NP, NP-hard and NP-complete, deterministic and non deterministic polynomial time algorithms., Approximation algorithms for some NP-complete problems. This paper deals with firefighter problem on rooted trees. This problem addresses the issue of timing when deploying viral campaigns. We would then do better by trying to design a good approximation algorithm rather than searching endlessly seeking an exact solution. It is known that the firefighter problem is NP-hard even for rooted trees of maximum degree 3. We propose techniques to improve a given approximation algorithm.