Maciel Zortea, Miguel Paredes, et al.
IGARSS 2021
Let a Golomb ruler be a set {ai} of integers so that all the differences ai - aj, i ≠ j, are distinct. Let H (I, J) be the smallest n such that there are I disjoint Golomb rulers each containing J elements chosen from {1, 2, ⋯, n}. In 1990, Kløve gave a table of bounds on H(I, J). In this correspondence we improve and extend this table with results found by computer search. © 1998 IEEE.
Maciel Zortea, Miguel Paredes, et al.
IGARSS 2021
Leo Liberti, James Ostrowski
Journal of Global Optimization
Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004
Anupam Gupta, Viswanath Nagarajan, et al.
Operations Research