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

More documents

Recommendations

Info

Fast Exponential-Time AlgorithmsConclusionsFor Further Reading IFomin, F.V., F. Grandoni, and D. Kratsch,Measure and conquer : Domination - A case study,Proc. of ICALP 2005, LNCS 3380, (2005), pp. 192–203.Fomin, F.V., F. Grandoni, and D. Kratsch,Some New Techniques in Design and Analysis of Exact (Exponential)Algorithms,Bulletin of the EATCS, 87, (2005), pp. 47–77.Moon, J. W., and L. Moser,On cliques in graphs,Israel J. Math., 3, (1965), pp. 23–28.Robson, J. M.,Finding a maximum independent set in time O(2 n/4 ),Tech. Rep. 1251-01, LaBRI, Université Bordeaux I, 2001.Tarjan, R.E., and A.E. Trojanowski,Finding a maximum independent set,SIAM Journal on Computing 6 (1977), pp. 537–546.
Fast Exponential-Time AlgorithmsConclusionsFor Further Reading IIWilliams, R.,A new algorithm for optimal constraint 2-satisfaction and its implications,Theoretical Computer Science 348 (2005), pp. 357-365.Woeginger, G. J.,Exact algorithms for NP-hard problems : A survey,Combinatorial Optimization - Eureka, You Shrink !, LNCS 2570, (2003),pp. 185–207.
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 13 and 14:
11/52Fast Exponential-Time Algorith
Page 15 and 16: 13/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 65: Fast Exponential-Time AlgorithmsCon
show all

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

Create successful ePaper yourself

Delete template?

Save as template?