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

More documents

Recommendations

Info

6/52Fast Exponential-Time AlgorithmsIntroductionHistorySome Old AlgorithmsBefore 1990TSP O ∗ (2 n ) Held, Karp (1962)COLORING O(2.4422 n ) Lawler (1976)3-COLORING O(1.4422 n ) Lawler (1976)3-SAT O(1.6181 n ) Speckenmeyer,Monien (1985)INDEPEDENT SET O(1.2108 n ) Robson (1986)
7/52Fast Exponential-Time AlgorithmsIntroductionHistorySome New AlgorithmsLast DecadeBANDWIDTH O ∗ (10 n ) Feige, Kilian (2000)3-SAT O(1.4802 n ) Dantsin et al. (2002)MAXIMUM CUT O(1.7315 n ) Williams (ICALP 2004)TREEWIDTH O(1.9601 n ) Fomin et al. (ICALP 2004)3-COLORING O(1.3289 n ) Beigel, Eppstein (2005)DOMINATING SET O(1.5137 n ) Fomin et al. (ICALP 2005)COLORING O ∗ (2 n ) Björklund, Husfeldt (FOCS 2006)
Page 1 and 2: Fast Exponential-Time Algorithms/52
Page 3 and 4: 3/52Fast Exponential-Time Algorithm
Page 5: 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 and 52: well without modifying the maximum7
Page 57 and 58:
2/52Fast Exponential-Time Algorithm
Page 59 and 60:
4/52Fast Exponential-Time Algorithm
Page 61 and 62:
46/52Fast Exponential-Time Algorith
Page 63 and 64:
48/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?