Kernelizing the Hitting Set Problem in Linear Sequential and Constant Parallel Time

We analyze a reduction rule for computing kernels for the hitting set problem: In a hypergraph, the link of a set c of vertices consists of all edges that are supersets of c. We call such a set critical if its link has certain easy-to-check size properties. The rule states that the link of a critical c can be replaced by c. It is known that a simple linear-time algorithm for computing hitting set kernels (number of edges) at most k^d (k is the hitting set size, d is the maximum edge size) can be derived from this rule. We parallelize this algorithm and obtain the first AC⁰ kernel algorithm that outputs polynomial-size kernels. Previously, such algorithms were not even known for artificial problems. An interesting application of our methods lies in traditional, non-parameterized approximation theory: Our results imply that uniform AC⁰-circuits can compute a hitting set whose size is polynomial in the size of an optimal hitting set.

[1]  Henning Fernau,et al.  Approximation Algorithms Inspired by Kernelization Methods , 2014, ISAAC.

[2]  Max Bannach,et al.  Fast Parallel Fixed-parameter Algorithms via Color Coding , 2015, IPEC.

[3]  René van Bevern.  Towards Optimal and Expressive Kernelization for d-Hitting Set , 2011, Algorithmica.

[4]  Michael Elberfeld,et al.  On the Space and Circuit Complexity of Parameterized Problems: Classes and Completeness , 2015, Algorithmica.

[5]  N. Immerman,et al.  On uniformity within NC 1 . , 1988 .

[6]  Peter Damaschke.  Parameterized enumeration, transversals, and imperfect phylogeny reconstruction , 2006, Theor. Comput. Sci..

[7]  H. L. Abbott,et al.  Intersection Theorems for Systems of Sets , 1972, J. Comb. Theory, Ser. A.

[8]  Miriam Di Ianni,et al.  Parameterized Parallel Complexity , 1998, Euro-Par.

[9]  Liming Cai,et al.  Advice Classes of Parameterized Tractability , 1997, Ann. Pure Appl. Log..

[10]  Max Bannach,et al.  Computing Kernels in Parallel: Lower and Upper Bounds , 2018, IPEC.

[11]  Yijia Chen,et al.  Slicewise definability in first-order logic with bounded quantifier rank , 2017, CSL.

[12]  Michael R. Fellows,et al.  FIXED-PARAMETER TRACTABILITY AND COMPLETENESS , 2022 .

[13]  Max Bannach,et al.  Computing Hitting Set Kernels By AC0-Circuits , 2018, Theory of Computing Systems.

[14]  Michael R. Fellows,et al.  Parameterized approximation via fidelity preserving transformations , 2012, J. Comput. Syst. Sci..

[15]  Mam Riess Jones.  Color Coding , 1962, Human factors.

[16]  Hannes Moser,et al.  A Problem Kernelization for Graph Packing , 2009, SOFSEM.

[17]  Fahad Panolan,et al.  Lossy kernelization , 2016, STOC.

[18]  Miklós Ajtai,et al.  Approximate Counting with Uniform Constant-Depth Circuits , 1990, Advances In Computational Complexity Theory.

[19]  Avi Wigderson,et al.  Perfect hashing, graph entropy, and circuit complexity , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

[20]  Michael R. Fellows,et al.  On problems without polynomial kernels , 2009, J. Comput. Syst. Sci..

[21]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[22]  Stefan Fafianie,et al.  A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time , 2015, MFCS.