Parameterized complexity: The main ideas and connections to practical computing

Electronic Notes in Theoretical Computer Science

Volumn 61, Issue , 2002, Pages 1-19

  Fellows, Michael R ^a  

^a UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; HEURISTIC METHODS; INFORMATION ANALYSIS; INTEGER PROGRAMMING; PARAMETER ESTIMATION; SET THEORY;

EMPIRICAL MOTIVATION; HALTING PROBLEM; KERNELIZATION; PARAMETERIZED COMPLEXITY; PARAMETERIZED LANGUAGES; PRACTICAL COMPUTING;

COMPUTATIONAL COMPLEXITY;

EID: 19144370693     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00301-9     Document Type: Conference Paper

References (45)

1. Abrahamson K., Downey R., Fellows M. "Fixed Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogs," Annals of Pure and Applied Logic. 73:1995;235-276
2. J. Alber, H. Fernau and R. Niedermeier, "Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems," in: Proceedings of ICALP 2001, Crete, Greece, Lecture Notes in Computer Science vol. 2076 (2001), 261-272.
3. Alber J., Gramm J., Niedermeier R. "Faster Exact Algorithms for Hard Problems: A Parameterized Point of View," Discrete Mathematics. 229:2001;3-27
4. S. Arora, "Polynomial Time Approximation Schemes for Euclidean TSP and Other Geometric Problems," In: Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, 1996.
5. V. Arvind, "On the Parameterized Complexity of Counting Problems," Workshop on Parameterized Complexity, Madras, India, Dec. 2000.
6. V. Arvind, M. R. Fellows, M. Mahajan, V. Raman, S. S. Rao, F. A. Rosamond, C. R. Subramanian, "Parametric Duality and Fixed Parameter Tractability", manuscript 2001.
7. C. Bazgan, "Schémas d'approximation et complexité paramétrée," Rapport de stage de DEA d'Informatique à Orsay, 1995.
8. Bodlaender H., Downey R., Fellows M., Hallett M., Wareham H.T. "Parameterized Complexity Analysis in Computational Biology," Computer Applications in the Biosciences. 11:1995;49-57
9. Leizhen Cai, "The Complexity of Coloring Parameterized Graphs," to appear in Discrete Applied Math.
10. M. Cesati and M. Di Ianni, "Parameterized Parallel Complexity," Technical Report ECCC97-06, University of Trier, 1997.
11. Liming Cai and D. Juedes, "Subexponential Parameterized Algorithms Collapse the W-Hierarchy," in: Proceedings of ICALP 2001, Crete, Greece, LNCS 2076 (2001).
12. M. Cosner, R. Jansen, B. Moret, L. Raubeson, L. Wang, T. Warnow and S. Wyman, "A New Fast Heuristic for Computing the Breakpoint Phylogeny and Experimental Phylogenetic Analyses of Real and Synthetic Data," manuscript, 2000.
13. J. Chen, I.A. Kanj and W. Jia, "Vertex Cover: Further Observations and Further Improvements," Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'99), Lecture Notes in Computer Science 1665 (1999), 313-324.
14. P. Cheeseman, B. Kanefsky and W. Taylor, "Where the Really Hard Problems Are," Proc. 12th International Joint Conference on Artificial Intelligence (1991), 331-337.
15. Cai Leizhen, Schieber B. "A Linear Time Algorithm for Computing the Intersection of All Odd Cycles in a Graph," Discrete Applied Math. 73:1997;27-34
16. Cesati M., Trevisan L. "On the Efficiency of Polynomial Time Approximation Schemes," Information Processing Letters. 64:1997;165-171
17. M. Cesati and H. T. Wareham, "Parameterized Complexity Analysis in Robot Motion Planning," Proceedings 25th IEEE Intl. Conf. on Systems, Man and Cybernetics: Volume 1, IEEE Press, Los Alamitos, CA (1995), 880-885.
18. Downey R.G., Fellows M.R. Parameterized Complexity. 1998;Springer-Verlag
19. R. Downey and M. Fellows, "Parameterized Complexity After Almost Ten Years: Review and Open Questions," in: Combinatorics, Computation and Logic, DMTCS'99 and CATS'99, Australian Computer Science Communications, Springer-Verlag Singapore, vol. 21 (1999), 1-33.
20. R. G. Downey, M. R. Fellows and U. Stege, "Parameterized Complexity: A Framework for Systematically Confronting Computational Intractability." In: Contemporary Trends in Discrete Mathematics, (R. Graham, J. Kratochvil, J. Nesetril and F. Roberts, eds.), Proceedings of the DIMACS-DIMATIA Workshop, Prague, 1997, AMS-DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 49 (1999), 49-99.
21. R. G. Downey, M. Fellows and U. Taylor, "The Parameterized Complexity of Relational Database Queries and an Improved Characterization of W [1]," in: Combinatorics, Complexity and Logic: Proceedings of DMTCS'96, Springer-Verlag (1997), 194-213.
22. F. Dehne, A. Rau-Chaplin, U. Stege and P. Taillon, "Solving Large FPT Problems on Coarse Grained Parallel Machines," manuscript, 2001.
23. H. Fernau, "Remarks on Parameterized Enumeration," manuscript, 2001.
24. J. Flum and M. Grohe, "Describing Parameterized Complexity Classes," manuscript, 2001.
25. M. Fellows, C. McCartin, F. Rosamond and U. Stege, "Trees with Few and Many Leaves," manuscript, full version of the paper: "Coordinatized kernels and catalytic reductions: An improved FPT algorithm for max leaf spanning tree and other problems," Proceedings of the 20th FST TCS Conference, New Delhi, India, Lecture Notes in Computer Science vol. 1974, Springer Verlag (2000), 240-251.
26. Garey M., Johnson D. Computers and Intractability: A Guide to the Theory of NP-completeness. 1979;W.H. Freeman, San Francisco
27. G. Gutin and T. Kloks, "Kernels in Planar Digraphs," manuscript, 2001.
28. M. Grohe, "Generalized Model-Checking Problems for First-Order Logic," Proc. STACS 2001, Springer-Verlag LNCS vol. 2001 (2001), 12-26.
29. M. Grohe, "The Parameterized Complexity of Database Queries," Proc. PODS 2001, ACM Press (2001), 82-92.
30. G. Gottlob, F. Scarcello and M. Sideri, "Fixed Parameter Complexity in AI and Nonmonotonic Reasoning," to appear in The Artificial Intelligence Journal. Conference version in: Proc. of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'99), vol. 1730 of Lecture Notes in Artificial Intelligence (1999), 1-18.
31. M. Hallett, G. Gonnett and U. Stege, "Vertex Cover Revisited: A Hybrid Algorithm of Theory and Heuristic," manuscript, 1998.
32. F. Henglein and H. G. Mairson, "The Complexity of Type Inference for Higher-Order Typed Lambda Calculi." In Proc. Symp. on Principles of Programming Languages (POPL) (1991), 119-130.
33. S. Khanna and R. Motwani, "Towards a Syntactic Characterization of PTAS," in: Proc. STOC 1996, ACM Press (1996), 329-337.
34. S. Khot and V. Raman, 'Parameterized Complexity of Finding Subgraphs with Hereditary properties', Proceedings of the Sixth Annual International Computing and Combinatorics Conference (COCOON 2000) July 2000, Sydney, Australia, Lecture Notes in Computer Science, Springer Verlag 1858 (2000) 137-147.
35. O. Lichtenstein and A. Pneuli. "Checking That Finite-State Concurrents Programs Satisfy Their Linear Specification." In: Proceedings of the 12th ACM Symposium on Principles of Programming Languages (1985), 97-107.
36. P. Moscato, "Controllability, Parameterized Complexity, and the Systematic Design of Evolutionary Algorithms," manuscript, 2001 (http://www.densis.fee.unicamp.br/moscato).
37. Mahajan M., Raman V. "Parameterizing Above Guaranteed Values: MaxSat and MaxCut," J. Algorithms. 31:1999;335-354
38. B. Moret, S. Wyman, D. Bader, T. Warnow and M. Yan, "A New Implementation and Detailed Study of Breakpoint Analysis," manuscript, 2000.
39. R. Niedermeier, "Some Prospects for Efficient Fixed-Parameter Algorithms," Proc. SOFSEM'98 Springer-Verlag LNCS 1521 (1998), 168-185.
40. A. Natanzon, R. Shamir and R. Sharan, "A Polynomial-Time Approximation Algorithm for Minimum Fill-In," Proc. ACM Symposium on the Theory of Computing (STOC'98), ACM Press (1998), 41-47.
41. C. Papadimitriou and M. Yannakakis, "On the Complexity of Database Queries," Proc. ACM Symp. on Principles of Database Systems (1997), 12-19.
42. U. Stege, "Resolving Conflicts in Problems in Computational Biochemistry," Ph.D. dissertation, ETH, 2000.
43. M. Truszczynski, "On Computing Large and Small Stable Models," to appear in Journal of Logic Programming.
44. V. Raman, "Parameterized Complexity," in: Proceedings of the 7th National Seminar on Theoretical Computer Science, Chennai, India (1997), 1-18.
45. Weihe K. "On the Differences Between Practical and Applied," Dagstuhl Workshop on Experimental Algorithmics. September 2000