Skip to main content
SpringerLink
Log in

Pseudo-Kernelization: A Branch-then-Reduce Approach for FPT Problems

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

Pseudo-kernelization is introduced in this paper as a new strategy for improving fixed-parameter algorithms. This new technique works for bounded search tree algorithms by identifying favorable branching conditions whose absence could be used to reduce the size of corresponding problem instances. Pseudo-kernelization applies well to hitting set problems. It can be used either to improve the search tree size of a 3-Hitting-Set algorithm from O*(2.179k) to O*(2.05k), or to improve the kernel size from k3 to 27k. In this paper the parameterized 3-Hitting-Set and Face Cover problems are used as typical examples.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Division of Computer Science and Mathematics, Lebanese American University, N-5020 Beirut, Lebanon

    Faisal N. Abu-Khzam

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

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Faisal N. Abu-Khzam.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Abu-Khzam, F. Pseudo-Kernelization: A Branch-then-Reduce Approach for FPT Problems. Theory Comput Syst 41, 399–410 (2007). https://doi.org/10.1007/s00224-007-1344-0

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-007-1344-0

Keywords

Search

Navigation