Towards Optimal and Expressive Kernelization for d-Hitting Set

DOI10.1007/978-3-642-32241-9_11zbMath1364.68237OpenAlexW1596797682MaRDI QIDQ2914317

René van Bevern

Publication date: 25 September 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-32241-9_11

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Exploiting a hypergraph model for finding Golomb rulers

This page was built for publication: Towards Optimal and Expressive Kernelization for d-Hitting Set