Pseudo-kernelization: A branch-then-Reduce approach for FPT problems
From MaRDI portal
Publication:2464328
DOI10.1007/S00224-007-1344-0zbMath1147.68528OpenAlexW1977459946MaRDI QIDQ2464328
Publication date: 19 December 2007
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-007-1344-0
Nonnumerical algorithms (68W05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
This page was built for publication: Pseudo-kernelization: A branch-then-Reduce approach for FPT problems
