The complexity ecology of parameters: An illustration using bounded max leaf number

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4497 LNCS, Issue , 2007, Pages 268-277

  Fellows, Michael ^a,b   Rosamond, Frances ^a  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; NUMBER THEORY; PARAMETER ESTIMATION; PARAMETERIZATION; POLYNOMIALS;

CONCRETE ALGORITHMIC; PARAMETER MAX LEAF NUMBER;

PROBLEM SOLVING;

EID: 38149070096     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73001-9_28     Document Type: Conference Paper

References (31)

1. Abu-Khzam, F.N., Collins, R.L., Fellows, M.R., Langston, M.A., Suters, W.H., Symons, C.T.: Kernelization algorithms for the vertex cover problem: theory and experiments. In: Arge, L., Italiano, G., Sedgewick, R. (eds.) Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, ACM/SIAM, Proc. Applied Mathematics 115 (January 2004)
2. Alber, J., Fellows, M., Niedermeier, R.: Polynomial time data reduction for dominating set. Journal of the ACM 51, 363-384 (2004)
3. Alber, J., Niedermeier, R.: Improved Tree Decomposition Based Algorithms for Domination-Like Problems. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, pp. 613-627. Springer, Heidelberg (2002)
4. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12, 308-340 (1991)
5. Bodlaender, H.L., Koster, A.M.: Combinatorial optimisation on graphs of bounded treewidth. The Computer Journal (to appear 2007)
6. Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small width. SIAM J. Computing 25, 1305-1317 (1996)
7. 2) steps. In: Hromkovič, J., Nagl, M., West-fechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 257-269. Springer, Heidelberg (2004)
8. Chen, J., Kanj, I., Xia, G.: Simplicity is beauty: improved upper bounds for vertex cover. Manuscript communicated by email, April (2005)
9. Courcelle, B.: The monadic second order logic of graphs I: Recognizable sets of finite graphs. Information and Computation 85, 12-75 (1990)
10. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
11. Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs. Journal of the ACM 52, 866-893 (2005)
12. Downey, R., Fellows, M., Stege, U.: Parameterized complexity: a framework for systematically confronting computational intractability. In: Graham, R., Kratochvil, J., Nesetril, J., Roberts, F. (eds.) Contemporary Trends in Discrete Mathematics, Proceedings of the DIMACS-DIMATIA Workshop on the Future of Discrete Mathematics, Prague, 1997. AMS-DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 49, pp. 49-99 (1999)
13. Demaine, E.D., Hajiaghayi, M.: Bidimensionality: New connections between FPT algorithms and PTASs. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), Vancouver, pp. 590-601 (January 2005)
14. Demaine, E.D., Hajiaghayi, M.: The bidimensionality theory and its algorithmic applications. The Computer Journal (to appear)
15. Estivill-Castro, V., Fellows, M., Langston, M., Rosamond, F.: Fixedparameter tractability is P-time extremal structure theory I: The case of max leaf. In: Proceedings of ACiD 2005: Algorithms and Complexity in Durham pp. 1-41 (2005)
16. Fellows, M.: Parameterized complexity: the main ideas and connections to practical computing. In: Fleischer, R., Moret, B.M.E., Schmidt, E.M. (eds.) Experimental Algorithmics. LNCS, vol. 2547, pp. 51-77. Springer, Heidelberg (2002)
17. Flum, J., Prick, M., Grohe, M.: Query evaluation via tree-decompositions. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol. 1973, pp. 22-32. Springer, Heidelberg (2000)
18. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
19. Fomin, F., Kratsch, D., Woeginger, G.: Exact (exponential) algorithms for the dominating set problem. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 245-256. Springer, Heidelberg (2004)
20. Grohe, M., Marino, J.: Definability and descriptive complexity on databases with bounded treewidth. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 70-82. Springer, Heidelberg (1998)
21. Grohe, M.: The parameterized complexity of database queries. In: Proc. PODS 2001, pp. 82-92. ACM Press, New York (2001)
22. Gurevich, Y.: The Challenger-Solver Game: Variations on the Theme of P=? NP, Bulletin EATCS 39 pp. 112-121 (1989)
23. Guo, J., Gramm, J., Hueffner, F., Niedermeier, R., Wernicke, S.: Improved fixed-parameter algorithms for two feedback set problems. In: Dehne, F., López-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol. 3608, pp. 158-169. Springer, Heidelberg (2005)
24. Niedermeier, R.: Ubiquitous parameterization - invitation to fixed-parameter algorithms. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds.) MFCS 2004, LNCS, vol. 3153, pp. 84-103. Springer, Heidelberg (2004)
25. Niedermeier, R.: Invitation to Fixed Parameter Algorithms (forthcoming). Oxford University Press, Oxford (2005)
26. Nemhauser, G.L., Trotter, L.E.: Vertex packings: structural properties and algorithms. Mathematical Programming 8, 232-248 (1975)
27. Prieto-Rodriguez, E.: Systematic kernelization in FPT algorithm design. Ph.D. Thesis, School of EE&CS, University of Newcastle, Australia (2005)
28. Raman, V.: Parameterized Complexity. In: Proceedings of the 7th National Seminar on Theoretical Computer Science, Chennai, India, pp. 1-18 (1997)
29. Robertson, N., Seymour, P.: Graph minors: a survey. In: Anderson, J. (ed.) Surveys in Combinatorics, pp. 153-171. Cambridge University Press, Cambridge (1985)
30. Telle, J.A., Proskurowski, A.: Practical Algorithms on Partial k-Trees with an Application to Domination-Like Problems. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1993. LNCS, vol. 709, pp. 610-621. Springer, Heidelberg (1993)
31. Weihe, K.: Covering trains by stations, or the power of data reduction. In: Proc. ALEX'98 pp. 1-8 (1998)