MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I've faced the beltway reconstruction problem and I've developed a simple backtrack algorithm, what algorithms do you know for this problem?
Beltway Reconstruction Problem:
Assume there is a set of non-identical integers between 0 and N, we only have pairwise distances of points of that set mod N, How can we reconstruct the original set using this?

share|cite|improve this question
cross-posted on Theoretical Computer Science. – Kaveh Jul 9 '13 at 8:38
See also the MO question Difference Sets, which also discusses the beltway reconstruction problem. – Joseph O'Rourke Jul 9 '13 at 10:42
up vote 1 down vote accepted

A relatively recent result for a sparse case can be found here (see Algorithm 2). It’s a probabilistic polynomial-time algorithm.

share|cite|improve this answer
Thanks. I've read these two papers: Reconstruction of Integers from Pairwise Distances & Reconstructing Sets From Interpoint Distances. Any other references? – Mahdi Khosravi Jul 9 '13 at 7:16

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.