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

More documents

Recommendations

Info

47/52Fast Exponential-Time AlgorithmsSplit and ListSplit and ListNew method to design exponential-time algorithmsIntroduced by Williams 2004Typical running time O(2 2.376 n/3 ) = O(1.7315 n )Resembles Sort and Search
48/52Fast Exponential-Time AlgorithmsTreewidth BasedTreewidth Based AlgorithmsTechnique for designing exponential-time algorithmsmainly for special graph classesplanar graphs, graphs of maximum degree 3Example : 2 n/6 time algorithm to compute a maximumindependent set in graphs of degree at most 3
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:
Page 9 and 10:
Page 11 and 12: 10/52Fast Exponential-Time Algorith
Page 17 and 18: 5/52Fast Exponential-Time Algorithm
Page 49 and 50: x v, we can discard its mirrors as
Page 51 and 52: well without modifying the maximum7
Page 61: 46/52Fast Exponential-Time Algorith
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?