Fast Exponential-Time Algorithms to solve NP-complete ... - Lita

More documents

Recommendations

Info

52Fast Exponential-Time AlgorithmsIntroductionMotivationHow good can exponential algorithms be ?For all inputs of size n, can we reach worst-case running timeO(n!)O(2 n2 )O(10 n )O(2 n )O(c n ) for some constant c ≥ 1 sufficiently close to 1or even a subexponential algorithm ? ?
52Fast Exponential-Time AlgorithmsIntroductionMotivationWhy Studying Exponential-Time Algorithms ?certain applications require exact solutions of NP-hardproblemsapproximation algorithms and fixed parameter algorithms arenot always satisfactoryreduction of the base of the exponential running time, sayfrom O(2 n ) to O(1.4 n ), increases the size of the instancessolvable within a given amount of time by a constantmultiplicative factorrunning a given exponential algorithm on a faster computercan enlarge the mentioned size only by an additive factorleads to a better understanding of NP-hard problemsinitiates interesting new combinatorial and algorithmicchallenges
Page 1 and 2: Fast Exponential-Time Algorithms/52
Page 3: 3/52Fast Exponential-Time Algorithm
Page 7 and 8: 7/52Fast Exponential-Time Algorithm
Page 11 and 12: 10/52Fast Exponential-Time Algorith
Page 49 and 50: x v, we can discard its mirrors as
Page 51 and 52: well without modifying the maximum7
Page 55 and 56:
40/52Fast Exponential-Time Algorith
Page 57 and 58:
2/52Fast Exponential-Time Algorithm
Page 59 and 60:
4/52Fast Exponential-Time Algorithm
Page 61 and 62:
Page 63 and 64:
Page 65 and 66:
Fast Exponential-Time AlgorithmsCon
Page 67:
Fast Exponential-Time AlgorithmsCon
show all

Fast Exponential-Time Algorithms to solve NP-complete ... - Lita

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?