Title of article :
On the complexity of constructing Golomb Rulers Original Research Article
Author/Authors :
Christophe Meyer، نويسنده , , Periklis A. Papakonstantinou، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2009
Pages :
11
From page :
738
To page :
748
Abstract :
A Golomb Ruler is a ruler with integer marks where the distances between every two marks are distinct. Golomb Rulers find diverse applications in computer science and electrical engineering. According to our knowledge the computational complexity of problems related to the construction of Golomb Rulers is unknown. We provide natural definitions for problems re
Keywords :
View the MathML sourceNP-hardness , Finite View the MathML sourceB2 set , Golomb ruler
Journal title :
Discrete Applied Mathematics
Serial Year :
2009
Journal title :
Discrete Applied Mathematics
Record number :
887009
Link To Document :
بازگشت