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

More documents

Recommendations

Info

2/52Fast Exponential-Time AlgorithmsIntroductionMotivationHow to attack NP-hard problemsVarious techniques have been developped to attack NP-hardproblems :approximation algorithmsparameterized algorithmsrandomized algorithmsrestricted inputsexponential-time algorithms
3/52Fast Exponential-Time AlgorithmsIntroductionMotivationExact Exponential-Time Algorithmsone of the oldest methodsdating back to the early sixtiesDavis, Putnam (1960) and Held, Karp (1962)tries to cope with NP-completeness in the strongest senseanalysis of worst-case running time
Page 1: Fast Exponential-Time Algorithms/52
Page 5 and 6: 52Fast Exponential-Time AlgorithmsI
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 53 and 54:
38/52Fast Exponential-Time Algorith
Page 55 and 56:
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

Create successful ePaper yourself

Delete template?

Save as template?