Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Parameterized and Exact Computation

IWPEC 2006: Parameterized and Exact Computation pp 251–263Cite as

Towards a Taxonomy of Techniques for Designing Parameterized Algorithms

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4169))

Abstract

A survey is given of the main techniques in parameterized algorithm design, with a focus on formal descriptions of the less familiar techniques. A taxonomy of techniques is proposed, under the four main headings of Branching, Kernelization, Induction and Win/Win. In this classification the Extremal Method is viewed as the natural maximization counterpart of Iterative Compression, under the heading of Induction. The formal description given of Greedy Localization generalizes the application of this technique to a larger class of problems.

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. Abu-Khzam, F., Collins, R., Fellows, M., Langston, M.: Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments. In: Proceedings ALENEX 2004. LNCS, vol. 3353, pp. 235–244. Springer, Heidelberg (2004)

    Google Scholar 

  2. Alber, J., Bodlaender, H.L., Fernau, H., Kloks, T., Niedermeier, R.: Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica 33, 461–493 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  3. Alon, N., Yuster, R., Zwick, U.: Color-Coding. Journal of the ACM 42(4), 844–856 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  4. Chor, B., Fellows, M., Juedes, D.W.: Linear Kernels in Linear Time, or How to Save k Colors in O(n 2) steps. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 257–269. Springer, Heidelberg (2004)

    Google Scholar 

  5. Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1999)

    Google Scholar 

  6. Dehne, F., Fellows, M., Rosamond, F.: An FPT Algorithm for Set Splitting. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353. Springer, Heidelberg (2004)

    Google Scholar 

  7. Dehne, F., Fellows, M., Rosamond, F.A., Shaw, P.: Greedy Localization, Iterative Compression and Modeled Crown Reductions: New FPT Techniques and Improved Algorithms for Max Set Splitting and Vertex Cover. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 271–280. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  8. Demaine, E., Hajiaghayi, M.: Bidimensionality: New Connections between FPT Algorithms and PTASs. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), January 23-25, pp. 590–601 (2005)

    Google Scholar 

  9. Fellows, M.R.: Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPT. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 1–12. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  10. Fellows, M.R., Knauer, C., Nishimura, N., Ragde, P., Rosamond, F.A., Stege, U., Thilikos, D.M., Whitesides, S.H.: Faster fixed-parameter tractable algorithms for matching and packing problems. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 311–322. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  11. Fellows, M., Heggernes, P., Rosamond, F.A., Sloper, C., Telle, J.A.: Finding k disjoint triangles in an arbitrary graph. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 235–244. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  12. Fellows, M.R., McCartin, C., Rosamond, F., Stege, U.: Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems. In: Foundations of Software Technology and Theoretical Computer Science (2000)

    Google Scholar 

  13. Jia, W., Zhang, C., Chen, J.: An efficient parameterized algorithm for m-set packing. Journal of Algorithms 50(1), 106–117 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  14. Kullmann, O.: Investigations on autark assignments. Discrete Applied Mathematics 107, 99–138 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  15. Kullmann, O.: Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets. Discrete Applied Mathematics 130, 209–249 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  16. Mathieson, L., Prieto, E., Shaw, P.: Packing Edge Disjoint Triangles: A Parameterized View. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 127–137. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  17. Manber, U.: Introduction to algorithms, a creative approach. Addison Wesley Publishing, Reading (1989)

    MATH  Google Scholar 

  18. Mahajan, M., Raman, V.: Parameterizing above guaranteed values: MaxSat and MaxCut. Journal of Algorithms 31(2), 335–354 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  19. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms, a book version was recently announced by Oxford University Press (manuscript, 2002)

    Google Scholar 

  20. Niedermeier, R., Rossmanith, P.: A general method to speed up fixed parameter algorithms. Information Processing Letters 73, 125–129 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  21. Nemhauser, G., Trotter Jr., L.: Vertex Packings: Structural properties and algorithms. Mathematical Programming 8, 232–248 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  22. Prieto, E.: The Method of Extremal Structure on the k-Maximum Cut Problem. In: Proc. Computing: The Australasian Theory Symposium (CATS 2005). Conferences in Research and Practice in Information Technology, vol. 41, pp. 119–126 (2005)

    Google Scholar 

  23. Prieto, E.: Systematic kernelization in FPT algorithm design. PhD thesis, University of Newcastle, Australia (2005)

    Google Scholar 

  24. Prieto, E., Sloper, C.: Either/Or: Using Vertex Cover Structure in Designing FPT-Algorithms — the Case of k-Internal Spanning Tree. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 474–483. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  25. Prieto, E., Sloper, C.: Looking at the stars. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 138–148. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  26. Prieto, E., Sloper, C.: Reducing to Independent Set Structure — the Case of k -Internal Spanning Tree. Nordic Journal of Computing 12(3), 308–318 (2005)

    MATH  MathSciNet  Google Scholar 

  27. Robertson, N., Seymour, P.D.: Graph Minors XX Wagner’s conjecture (to appear)

    Google Scholar 

  28. Reed, B., Smith, K., Vetta, A.: Finding Odd Cycle Transversals. Operations Research Letters 32, 299–301 (2003)

    Article  MathSciNet  Google Scholar 

  29. Sloper, C.: Techniques in Parameterized Algorithm Design. PhD thesis, University of Bergen (2006), http://www.ii.uib.no/~sloper

  30. Schmidt, J.P., Siegel, A.: The spatial complexity of oblivious k-probe hash functions. SIAM Journal of Computing 19(5), 775–786 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  31. Seymour, P.D., Thomas, R.: Call routing and the ratcatcher. Combinatorica 14(2), 217–241 (1994)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, University of Bergen, Norway

    Christian Sloper & Jan Arne Telle

Authors
  1. Christian Sloper
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jan Arne Telle
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Information and Computing Sciences, Utrecht University, The Netherlands

    Hans L. Bodlaender

  2. University of Tennessee, 37996-3450, Knoxville, Tennessee, U.S.A.

    Michael A. Langston

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sloper, C., Telle, J.A. (2006). Towards a Taxonomy of Techniques for Designing Parameterized Algorithms. In: Bodlaender, H.L., Langston, M.A. (eds) Parameterized and Exact Computation. IWPEC 2006. Lecture Notes in Computer Science, vol 4169. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11847250_23

Download citation

  • DOI: https://doi.org/10.1007/11847250_23

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39101-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation