A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time

DOI10.1007/978-3-662-48054-0_25zbMath1465.68111arXiv1504.08235OpenAlexW2248154729MaRDI QIDQ2946401

Stefan Fafianie, Stefan Kratsch

Publication date: 16 September 2015

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

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

Mathematics Subject Classification ID

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

Related Items

A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time ⋮ Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space ⋮ Fixed-parameter algorithms for DAG partitioning ⋮ The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Approximation in (Poly-) logarithmic space ⋮ Approximation in (Poly-) Logarithmic Space ⋮ Dynamic kernels for hitting sets and set packing

Cites Work

• Unnamed Item
• Unnamed Item
• Towards optimal and expressive kernelization for \(d\)-hitting set
• Advice classes of parametrized tractability
• An efficient fixed-parameter algorithm for 3-hitting set
• Top-down lower bounds for depth-three circuits
• Parametrized complexity theory.
• A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time
• Extremal Combinatorics
• Intersection Theorems for Systems of Sets
• Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms