Exploiting a Hypergraph Model for Finding Golomb Rulers
From MaRDI portal
Publication:3167640
DOI10.1007/978-3-642-32147-4_33zbMath1360.68519MaRDI QIDQ3167640
Rolf Niedermeier, Mathias Weller, Manuel Sorge, Hannes Moser
Publication date: 2 November 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-32147-4_33
data reduction; NP-hardness; parameterized complexity; hitting set; problem kernel; forbidden subgraph characterization
68Q25: Analysis of algorithms and problem complexity
05C65: Hypergraphs
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)