Anupam Gupta, Viswanath Nagarajan, et al.
Operations Research
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.
Anupam Gupta, Viswanath Nagarajan, et al.
Operations Research
Limin Hu
IEEE/ACM Transactions on Networking
Erich P. Stuntebeck, John S. Davis II, et al.
HotMobile 2008
David A. Selby
IBM J. Res. Dev