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

More documents

Recommendations

Info

8/52Fast Exponential-Time AlgorithmsBranchingThe Algorithm of Fomin et al.Measure & ConquerA standard analysis of the worst case running time would establishrunning time O(1.3251 n ) for the algorithm. [Tarjan, TrojanowskiO(1.2600 n ) ! !]A better choice of the measure of a problem instance mayallow to obtain a better upper bound on the worst caserunning time of the same algorithm.Thus a nonstandard measure is a tool to improve theanalysis of the worst case running time of Branch & Reducealgorithms.
38/52Fast Exponential-Time AlgorithmsBranchingThe Algorithm of Fomin et al.Measure & ConquerA standard analysis of the worst case running time would establishrunning time O(1.3251 n ) for the algorithm. [Tarjan, TrojanowskiO(1.2600 n ) ! !]A better choice of the measure of a problem instance mayallow to obtain a better upper bound on the worst caserunning time of the same algorithm.Thus a nonstandard measure is a tool to improve theanalysis of the worst case running time of Branch & Reducealgorithms.
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 11 and 12: 10/52Fast Exponential-Time Algorith
Page 49 and 50: x v, we can discard its mirrors as
Page 51: well without modifying the maximum7
Page 65 and 66: Fast Exponential-Time AlgorithmsCon
Page 67: Fast Exponential-Time AlgorithmsCon

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

Create successful ePaper yourself

Delete template?

Save as template?