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

More documents

Recommendations

Info

45/52Fast Exponential-Time AlgorithmsBranchingThe Algorithm of Fomin et al.Analysis of the Running TimeToolsMeasure & Conquer based analysis of the running timeprogram based on randomized local search to computeoptimal values of the w i ’ssophisticated analysisRunning TimeThe algorithm of Fomin et al. has running time O(1.2202 n ). Thisis the best known running time of a polynomial space algorithm tocompute a maximum independent set.
46/52Fast Exponential-Time AlgorithmsSort and SearchSort and SearchOld method to design exponential-time algorithmsIntroduced by Horowitz, Sahni 1974Typical running time O(2 n/2 ) = O(1.4142 n )
Page 1 and 2:
Fast Exponential-Time Algorithms/52
Page 3 and 4:
3/52Fast Exponential-Time Algorithm
Page 5 and 6:
52Fast Exponential-Time AlgorithmsI
Page 7 and 8:
7/52Fast Exponential-Time Algorithm
Page 9 and 10: 9/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 59: 4/52Fast Exponential-Time Algorithm
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?