Kernel(s) for problems with no kernel
From MaRDI portal
Publication:3189081
DOI10.1145/2344422.2344428zbMath1295.68120WikidataQ60488494 ScholiaQ60488494MaRDI QIDQ3189081
Henning Fernau, Fedor V. Fomin, Saket Saurabh, Daniel Lokshtanov, Yngve Villanger, Daniel Binkele-Raible
Publication date: 9 September 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2344422.2344428
05C05: Trees
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms