A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time
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 kernel 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 ).
- 2.Dell, H., Marx, D.: Kernelization of packing problems. In: Proceedings of the Twenty-third Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 68–81. SIAM (2012)Google Scholar
- 4.Fafianie, S., Kratsch, S.: A shortcut to (sun) flowers: Kernels in logarithmic space or linear time. arXiv report 1504.08235 (2015)Google Scholar
- 5.Flum, J., Grohe, M.: Parameterized complexity theory, volume XIV of texts in theoretical computer science. In: An EATCS Series (2006)Google Scholar
- 6.Fomin, F.V., Lokshtanov, D., Saurabh, S.: Efficient computation of representative sets with applications in parameterized and exact algorithms. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 142–151. SIAM (2014)Google Scholar
- 10.Lokshtanov, D.: New methods in parameterized algorithms and complexity. Ph.D thesis, Citeseer (2009)Google Scholar