Kernelization Algorithms for Packing Problems Allowing Overlaps

DOI10.1007/978-3-319-17142-5_35zbMath1460.68074arXiv1411.6915MaRDI QIDQ2948487

Henning Fernau, Alejandro López-Ortiz, Jazmín Romero

Publication date: 30 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68Q27: Parameterized complexity, tractability and kernelization