A shortcut to (sun)flowers: kernels in logarithmic space or linear time

DOI10.1007/978-3-662-48054-0_25zbMATH Open1465.68111arXiv1504.08235OpenAlexW2248154729MaRDI QIDQ2946401FDOQ2946401

Authors: Stefan Fafianie, Stefan Kratsch 

Publication date: 16 September 2015

Published in: Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)

Abstract: We investigate whether kernelization results can be obtained if we restrict kernelization algorithms to run in logarithmic space. This restriction for kernelization is motivated by the question of what results are attainable for preprocessing via simple and/or local reduction rules. We find kernelizations for d-Hitting Set(k), d-Set Packing(k), Edge Dominating Set(k) and a number of hitting and packing problems in graphs, each running in logspace. Additionally, we return to the question of linear-time kernelization. For d-Hitting Set(k) a linear-time kernelization was given by van Bevern [Algorithmica (2014)]. We give a simpler procedure and save a large constant factor in the size bound. Furthermore, we show that we can obtain a linear-time kernel for d-Set Packing(k) as well.

Full work available at URL: https://arxiv.org/abs/1504.08235

Recommendations

• Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space
• A kernelization algorithm for \(d\)-hitting set
• Kernelization Algorithms for d-Hitting Set Problems
• Towards optimal and expressive kernelization for \(d\)-hitting set
• Towards optimal and expressive kernelization for \(d\)-hitting set

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Efficient computation of representative sets with applications in parameterized and exact algorithms
• Parametrized complexity theory.
• Recent developments in kernelization: a survey
• Intersection Theorems for Systems of Sets
• Top-down lower bounds for depth-three circuits
• Advice classes of parametrized tractability
• Kernelization of packing problems
• Extremal combinatorics. With applications in computer science
• An efficient fixed-parameter algorithm for 3-hitting set
• Towards optimal and expressive kernelization for \(d\)-hitting set
• A shortcut to (sun)flowers: kernels in logarithmic space or linear time

Cited In (11)

• Dynamic kernels for hitting sets and set packing
• Title not available (Why is that?)
• Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space
• On kernels for \(d\)-path vertex cover
• A shortcut to (sun)flowers: kernels in logarithmic space or linear time
• The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs
• Title not available (Why is that?)
• Approximation in (Poly-) Logarithmic Space
• Space-efficient graph kernelizations
• Fixed-parameter algorithms for DAG partitioning
• Approximation in (poly-) logarithmic space

This page was built for publication: A shortcut to (sun)flowers: kernels in logarithmic space or linear time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946401)