3-hitting set on Bounded Degree Hypergraphs: Upper and Lower Bounds on the Kernel Size

DOI10.1007/978-3-642-19754-3_17zbMATH Open1325.68109OpenAlexW2091872617MaRDI QIDQ2999343FDOQ2999343

Fenghui Zhang, Iyad Kanj

Publication date: 12 May 2011

Published in: Theory and Practice of Algorithms in (Computer) Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19754-3_17

zbMATH Keywords

kernellower boundsparameterized complexityupper boundshitting set

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65)

Cited In (2)

• Parameterized and Exact Computation
• Hitting Set for hypergraphs of low VC-dimension

This page was built for publication: 3-hitting set on Bounded Degree Hypergraphs: Upper and Lower Bounds on the Kernel Size

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999343)