Exploiting a hypergraph model for finding Golomb rulers
From MaRDI portal
Publication:471187
DOI10.1007/s00236-014-0202-1zbMath1360.68520MaRDI QIDQ471187
Rolf Niedermeier, Mathias Weller, Manuel Sorge, Hannes Moser
Publication date: 14 November 2014
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-014-0202-1
68Q25: Analysis of algorithms and problem complexity
05C65: Hypergraphs
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)