Integer and combinatorial optimization
Integer and combinatorial optimization
On lower bounds for numbered complete graphs
Proceedings of the third international conference on Graphs and optimization
Genetic Algorithm Approach to the Search for Golomb Rulers
Proceedings of the 6th International Conference on Genetic Algorithms
Using Modulo Rulers for Optimal Recovery Schemes in Distributed Computing
PRDC '04 Proceedings of the 10th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC'04)
Equivalence of some LP-based lower bounds for the Golomb ruler problem
Discrete Applied Mathematics
A new algorithm for Golomb ruler derivation and proof of the 19 mark ruler
IEEE Transactions on Information Theory
On the complexity of constructing Golomb Rulers
Discrete Applied Mathematics
Hi-index | 0.04 |
The Golomb Ruler problem consists in finding n integers such that all possible differences are distinct and such that the largest difference is minimum. We review three lower bounds based on linear programming that have been proposed in the literature for this problem, and propose a new one. We then show that these 4 lower bounds are equal. Finally we discuss some computational experience aiming at identifying the easiest lower bound to compute in practice.