Analyse d'Algorithme

Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia, Parametric duality and kernelization: lower bounds and upper bounds on kernel size symposium on theoretical aspects of computer science. pp. 269- 280 ,(2005) , 10.1007/978-3-540-31856-9_22

Rolf Niedermeier, Invitation to fixed-parameter algorithms ,(2006)

Frederic Dorn, Dynamic Programming and Fast Matrix Multiplication Lecture Notes in Computer Science. pp. 280- 291 ,(2006) , 10.1007/11841036_27

Johan M. M. van Rooij, Hans L. Bodlaender, Peter Rossmanith, Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution european symposium on algorithms. pp. 566- 577 ,(2009) , 10.1007/978-3-642-04128-0_51

Jens Lagergren, Stefan Arnborg, Finding minimal forbidden minors using a finite congruence international colloquium on automata, languages and programming. pp. 532- 543 ,(1991) , 10.1007/3-540-54233-7_161

Daniel Lokshtanov, Saket Saurabh, Dániel Marx, Known algorithms on graphs of bounded treewidth are probably optimal symposium on discrete algorithms. pp. 777- 789 ,(2011) , 10.5555/2133036.2133097

Eyal Amir, Efficient approximation for triangulation of minimum treewidth uncertainty in artificial intelligence. pp. 7- 15 ,(2001)

Petr Slavík, A tight analysis of the greedy algorithm for set cover symposium on the theory of computing. pp. 435- 441 ,(1996) , 10.1145/237814.237991

Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs Theory of Computing Systems. ,vol. 45, pp. 555- 576 ,(2009) , 10.1007/S00224-008-9112-3

Faisal N. Abu-Khzam, Michael R. Fellows, Michael A. Langston, W. Henry Suters, Crown Structures for Vertex Cover Kernelization Theory of Computing Systems. ,vol. 41, pp. 411- 430 ,(2007) , 10.1007/S00224-007-1328-0