Skip to main content
SpringerLink
Log in

Kernels: Annotated, Proper and Induced

  • Conference paper
Book cover Parameterized and Exact Computation (IWPEC 2006)

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

Included in the following conference series:

Abstract

The notion of a “problem kernel” plays a central role in the design of fixed-parameter algorithms. The \(\mathcal{FPT}\) literature is rich in kernelization algorithms that exhibit fundamentally different approaches. We highlight these differences and discuss several generalizations and restrictions of the standard notion.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abu-Khzam, F.N., Langston, M.A.: A direct algorithm for the parameterized face cover problem. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 213–222. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Alber, J., Dorn, B., Niedermeier, R.: A general data reduction scheme for domination in graphs. In: Wiedermann, J., Tel, G., Pokorný, J., Bieliková, M., Štuller, J. (eds.) SOFSEM 2006. LNCS, vol. 3831, pp. 137–147. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  3. Chen, J., Fernau, H., Kanj, I.A., Xia, G.: Parametric duality and kernelization: Lower bounds and upper bounds on kernel size. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 269–280. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. Dehne, F., Fellows, M.R., Fernau, H., Prieto, E., Rosamond, F.A.: nonblocker: Parameterized algorithmics for minimum dominating set. In: Wiedermann, J., Tel, G., Pokorný, J., Bieliková, M., Štuller, J. (eds.) SOFSEM 2006. LNCS, vol. 3831, pp. 237–245. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  5. Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Annals of Mathematics 162, 439–485 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  6. Dom, M., Guo, J., Hüffner, F., Niedermeier, R., Truß, A.: Fixed-parameter tractability results for feedback set problems in tournaments. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol. 3998, pp. 320–331. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

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

    Google Scholar 

  8. Downey, R.G., Fellows, M.R., Stege, U.: Parameterized complexity: A framework for systematically confronting computational intractability. In: Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, pp. 49–99 (1999)

    Google Scholar 

  9. Dujmović, V., Fernau, H., Kaufmann, M.: Fixed parameter algorithms for one-sided crossing minimization revisited. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 332–344. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  10. Fernau, H.: A top-down approach to search-trees: Improved algorithmics for 3-Hitting Set. Technical Report TR04-073, Electronic Colloquium on Computational Complexity ECCC (2004)

    Google Scholar 

  11. Fernau, H.: Parameterized Algorithmics: A Graph-Theoretic Approach. Habilitationsschrift, Universität Tübingen, Germany (2005)

    Google Scholar 

  12. Fernau, H.: Parameterized algorithmics for linear arrangement problems. In: CTW 2005: Workshop on Graphs and Combinatorial Optimization, University of Cologne, Germany, pp. 27–31 (2005) (Long version submitted)

    Google Scholar 

  13. Fernau, H.: Two-layer planarization: improving on parameterized algorithmics. Journal of Graph Algorithms and Applications 9, 205–238 (2005)

    MATH  MathSciNet  Google Scholar 

  14. Gramm, J., Guo, J., Hüffner, F., Niedermeier, R.: Automated generation of search tree algorithms for hard graph modification problems. Algorithmica 39, 321–347 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  15. Gutin, G., Rafiey, A., Szeider, S., Yeo, A.: The linear arrangement problem parameterized above guaranteed value. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol. 3998, pp. 356–367. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  16. Niedermeier, R., Rossmanith, P.: An efficient fixed-parameter algorithm for 3-Hitting Set. Journal of Discrete Algorithms 1, 89–102 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  17. Niedermeier, R., Rossmanith, P.: On efficient fixed parameter algorithms for weighted vertex cover. Journal of Algorithms 47, 63–77 (2003)

    MATH  MathSciNet  Google Scholar 

  18. Serna, M., Thilikos, D.M.: Parameterized complexity for graph layout problems. EATCS Bulletin 86, 41–65 (2005)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Division of Comp.Sci. & Math., Lebanese American University, Beirut, Lebanon

    Faisal N. Abu-Khzam

  2. FB 4—Abteilung Informatik, Universität Trier, 54286, Trier, Germany

    Henning Fernau

Authors
  1. Faisal N. Abu-Khzam
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Henning Fernau
    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

Abu-Khzam, F.N., Fernau, H. (2006). Kernels: Annotated, Proper and Induced. 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_24

Download citation

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

  • 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