کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
420360 683926 2006 25 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Equivalence of some LP-based lower bounds for the Golomb ruler problem
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Equivalence of some LP-based lower bounds for the Golomb ruler problem
چکیده انگلیسی

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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 154, Issue 1, 1 January 2006, Pages 120–144
نویسندگان
, ,