Latest News on Linear Problem April-21

Posted on April 17, 2021Categories Computer ScienceTags   Leave a comment on Latest News on Linear Problem April-21

[1] Linear Problem Kernels for NP-Hard Problems on Planar Graphs We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several concrete case studies, giving new kernelization results for Connected Vertex Cover, Minimum Edge Dominating Set, Maximum Triangle Packing, and Efficient Dominating Set on planar graphs. On the route to these results, we present effective, problem-specific data reduction rules that are useful in any approach attacking … Continue reading “Latest News on Linear Problem April-21”