Skip to main content
SpringerLink
Log in
Book cover

Experimental Algorithmics pp 51–77Cite as

Parameterized Complexity: The Main Ideas and Connections to Practical Computing

  • Chapter
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2547))

Abstract

The purposes of this paper are two: (1) to give an exposition of the main ideas of parameterized complexity, and (2) to discuss the connections of parameterized complexity to the systematic design of heuristics and approximation algorithms.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Abrahamson, R. Downey, and M. Fellows. Fixed parameter tractability and completeness IV: on completeness for W[P] and PSPACE analogs. Annals of Pure and Applied Logic 73:235–276, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  2. J. Alber, M. Fellows, and R. Niedermeier. Efficient data reduction for dominating set: a linear problem kernel for the planar case. To appear in the Proceedings of Scandinavian Workshop on Algorithms and Theory (SWAT’02). Springer Lecture Notes in Computer Science, 2002.

    Google Scholar 

  3. J. Alber, J. Gramm, and R. Niedermeier. Faster exact algorithms for hard problems: a parameterized point of view. Discrete Mathematics 229:3–27, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  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 (FOCS’96), pages 2–11, 1996.

    Google Scholar 

  5. S. Arora. Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. In Proceedings of the 38th Annual IEEE Symposium on the Foundations of Computer Science (FOCS’97), pages 554–563, 1997.

    Google Scholar 

  6. V. Arvind, M. R. Fellows, M. Mahajan, V. Raman, S. S. Rao, F. A. Rosamond, and C. R. Subramanian. Parametric duality and fixed parameter tractability. Manuscript, 2001.

    Google Scholar 

  7. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation. Springer-Verlag, Heidelberg, 1999.

    MATH  Google Scholar 

  8. N. Bansal and V. Raman. Upper bounds for MaxSat: further improved. In Proceedings of the 10th International Symposium on Algorithms and Computation (ISAAC’99). Springer Lecture Notes in Computer Science 1741, pages 247–258, 1999.

    Google Scholar 

  9. C. Bazgan. Schémas d’approximation et complexité paramétrée. Rapport de stage de DEA d’Informatique à Orsay, 1995.

    Google Scholar 

  10. M. Blanchette, G. Bourque, and D. Sankoff. Breakpoint phylogenies. In S. Miyano and T. Tagaki, editors, Genome Informatics 1997, Universal Academy Press, Tokyo, 1997, pages 25–34.

    Google Scholar 

  11. L. Cai. The complexity of coloring parameterized graphs. To appear in Discrete Applied Mathematics.

    Google Scholar 

  12. L. Cai, M. Fellows, D. Juedes, and F. Rosamond. Efficient polynomial-time approximation schemes for problems on planar structures: upper and lower bounds. Manuscript, 2001.

    Google Scholar 

  13. M. Cesati and L. Trevisan. On the efficiency of polynomial time approximation schemes. Information Processing Letters 64:165–171, 1997.

    Article  MathSciNet  Google Scholar 

  14. M. Cesati and H. T. Wareham. Parameterized complexity analysis in robot motion planning. In Proceedings of the 25th IEEE International Conference on Systems, Man and Cybernetics: Volume 1. IEEE Press, Los Alamitos, CA, pages 880–885, 1995.

    Google Scholar 

  15. P. Cheeseman, B. Kanefsky, and W. Taylor. Where the really hard problems are. In Proceedings of the 12th International Joint Conference on Artificial Intelligence, pages 331–337, 1991.

    Google Scholar 

  16. C. Chekuri and S. Khanna. A PTAS for the multiple knapsack problem. Manuscript, 2000.

    Google Scholar 

  17. J. Chen, I. A. Kanj, and W. Jia. Vertex cover: further observations and further improvements. In Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG’99). Springer Lecture Notes in Computer Science 1665, pages 313–324, 1999.

    Chapter  Google Scholar 

  18. J. Chen and A. Miranda. A polynomial-time approximation scheme for general multiprocessor scheduling. In Proceedings of the 31st Annual ACM Symposium on the Theory of Computing (STOC’99), pages 418–427, 1999.

    Google Scholar 

  19. F. Dehne, A. Rau-Chaplin, U. Stege, and P. Taillon. Solving large FPT problems on coarse grained parallel machines. Manuscript, 2001.

    Google Scholar 

  20. X. Deng, H. Feng, P. Zhang, and H. Zhu. A polynomial time approximation scheme for minimizing total completion time of unbounded batch scheduling. In Proceedings of the 12th International Symposium on Algorithms and Computation (ISAAC’01). Springer Lecture Notes in Computer Science 2223, pages 26–35, 2001.

    Google Scholar 

  21. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer-Verlag, Heidelberg, 1998.

    MATH  Google Scholar 

  22. R. G. Downey and M. Fellows. Parameterized complexity after almost ten years: review and open questions. In Proceedings of Combinatorics, Computation and Logic, DMTCS’99 and CATS’99, Australian Computer Science Communications, Springer-Verlag, Singapore, vol. 21, pages 1–33, 1999.

    MathSciNet  Google Scholar 

  23. 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, Heidelberg, pages 194–213, 1997.

    Google Scholar 

  24. R. G. Downey, M. R. Fellows, and U. Stege. Parameterized complexity: a framework for systematically confronting computational intractability. In R. Graham, J. Kratochvíl, J. Nesetril, and F. Roberts, editors, Proceedings of the DIMACS-DIMATIA Workshop, Prague, 1997. AMS-DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 49, pages 49–99, 1999.

    Google Scholar 

  25. T. Erlebach, K. Jansen, and E. Seidel. Polynomial time approximation schemes for geometric graphs. In Proceedings of the 12th Annual Symposium on Discrete Algorithms (SODA’01), pages 671–679, 2001.

    Google Scholar 

  26. 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. In Proceedings of the 20th FSTTCS Conference. Springer Lecture Notes in Computer Science 1974, pages 240–251, 2000.

    Google Scholar 

  27. J. Felsenstein. Private communication, 1997.

    Google Scholar 

  28. M. Galota, C. Glasser, S. Reith, and H. Vollmer. A polynomial time approximation scheme for base station positioning in UMTS networks. In Proceedings of Discrete Algorithms and Methods for Mobile Computing and Communication, 2001.

    Google Scholar 

  29. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco, 1979.

    MATH  Google Scholar 

  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 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR’99), Springer Lecture Notes in Artificial Intelligence 1730, pages 1–18, 1999.

    Google Scholar 

  31. J. Gramm and R. Niedermeier. Faster exact algorithms for Max2Sat. In Proceedings of the 4th Italian Conference on Algorithms and Complexity. Springer Lecture Notes in Computer Science 1767, pages 174–186, 2000.

    Google Scholar 

  32. M. Grohe. Generalized model-checking problems for first-order logic. In Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS’01). Springer Lecture Notes in Computer Science 2010, pages 12–26, 2001.

    Google Scholar 

  33. M. Grohe. The parameterized complexity of database queries. In Proceedings of the 20th ACM symposium on Principles of Database Systems (PODS’01), ACM Press, pages 82–92, 2001.

    Google Scholar 

  34. M. Hallett, G. Gonnett, and U. Stege. Vertex cover revisited: a hybrid algorithm of theory and heuristic. Manuscript, 1998.

    Google Scholar 

  35. F. Henglein and H. G. Mairson. The complexity of type inference for higher-order typed lambda calculi. In Proceedings of the 18th Annual ACM Symposium on Principles of Programming Languages (POPL’91), pages 119–130, 1991.

    Google Scholar 

  36. Y. Karuno and H. Nagamochi. A polynomial time approximation scheme for the multi-vehicle scheduling problem on a path with release and handling times. In Proceedings of the 12th International Symposium on Algorithms and Computation (ISAAC’01). Springer Lecture Notes in Computer Science 2223, 36–47, 2001.

    Google Scholar 

  37. S. Khanna and R. Motwani. Towards a syntactic characterization of PTAS. In Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC’96), pages 329–337, 1996.

    Google Scholar 

  38. S. Khot and V. Raman. Parameterized complexity of finding subgraphs with hereditary properties. In Proceedings of the 6th Annual International Computing and Combinatorics Conference (COCOON’00). Springer Lecture Notes in Computer Science 1858, pages 137–147, 2000.

    Google Scholar 

  39. 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 (POPL’85), pages 97–107, 1985.

    Google Scholar 

  40. B. Moret, S. Wyman, D. Bader, T. Warnow, and M. Yan. A new implementation and detailed study of breakpoint analysis. In Proceedings of the 6th Pacific Symposium on Biocomputing (PSB’01), pages 583–594, 2001.

    Google Scholar 

  41. P. Moscato. Controllability, parameterized complexity, and the systematic design of evolutionary algorithms. Manuscript, 2001. See http://www.densis.fee.unicamp.br/~moscato

  42. R. Niedermeier. Some prospects for efficient fixed-parameter algorithms. In Proceedings of the 25th Conference on Current Trends in Theory and Practice oof Informatics (SOFSEM’98). Springer Lecture Notes in Computer Science 1521, pages 168–185, 1998.

    Google Scholar 

  43. R. Niedermeier and P. Rossmanith. An efficient fixed parameter algorithm for 3-hitting set. Journal of Discrete Algorithms 2(1), 2001.

    Google Scholar 

  44. C. Papadimitriou and M. Yannakakis. On the complexity of database queries. In Proceedings of the 16th ACM Symposium on Principles of Database Systems (PODS’97), pages 12–19, 1997.

    Google Scholar 

  45. I. Pe'er and R. Shamir. The median problems for breakpoints are NP-complete. Electronic Colloquium on Computational Complexity Technical Report 98-071, http://www.ecc.uni-trier.de/eccc.

  46. V. Raman. Parameterized complexity. In Proceedings of the 7th National Seminar on Theoretical Computer Science, Chennai, India, pages 1–18, 1997.

    Google Scholar 

  47. H. Shachnai and T. Tamir. Polynomial time approximation schemes for class-constrained packing problems. In Proceedings of the 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX’ 00). Springer Lecture Notes in Computer Science 1913, pages 144–154, 2000.

    Chapter  Google Scholar 

  48. R. Shamir and D. Tzur. The maximum subforest problem: approximation and exact algorithms. In Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms (SODA’98), pages 394–399, 1998.

    Google Scholar 

  49. U. Stege. Resolving conflicts in problems in computational biochemistry. Ph.D. dissertation, ETH, 2000.

    Google Scholar 

  50. M. Truszczynski. On Computing Large and Small Stable Models. In Proceedings of the International Conference on Logic Programming, pages 169–183, 1999. Full version to appear in Journal of Logic Programming.

    Google Scholar 

  51. K. Weihe. Covering trains by stations, or the power of data reduction. In Proceedings of the 1st Workshop on Algorithm Engineering and Experiments (ALENEX’98). Springer Lecture Notes in Computer Science 1619, pages 1–8, 1998.

    Google Scholar 

  52. K. Weihe. On the differences between practical and applied. Dagstuhl Workshop on Experimental Algorithmics, September 2000.

    Google Scholar 

  53. B. Wu, G. Lancia, V. Bafna, K-M. Chao, R. Ravi, and C. Tang. A polynomial time approximation scheme for minimum routing cost spanning trees. In Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms (SODA’98), pages 21–32, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electrical Engineering and Computer Science, University of Newcastle, University Drive, 2308, Callaghan, NSW, Australia

    Michael R. Fellows

Authors
  1. Michael R. Fellows
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong

    Rudolf Fleischer

  2. Department of Computer Science, University of New Mexico, Farris Engineering Bldg, 87131-1386, Albuquerque, NM, USA

    Bernard Moret

  3. Department of Computer Science, University of Aarhus, Bld. 540, Ny Munkegade, 8000, Aarhus C, Denmark

    Erik Meineche Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Fellows, M.R. (2002). Parameterized Complexity: The Main Ideas and Connections to Practical Computing. In: Fleischer, R., Moret, B., Schmidt, E.M. (eds) Experimental Algorithmics. Lecture Notes in Computer Science, vol 2547. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36383-1_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-36383-1_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00346-5

  • Online ISBN: 978-3-540-36383-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation