  We give an efficient construction of a reasonably small dominating set in a
circulant graph on $n$ notes and $k$ distinct chord lengths. This result is
based on bounds on some double exponential sums. .
