1
$\begingroup$

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?

$\endgroup$
2

1 Answer 1

1
$\begingroup$

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

$\endgroup$
1
  • $\begingroup$ Thanks. I've read these two papers: Reconstruction of Integers from Pairwise Distances & Reconstructing Sets From Interpoint Distances. Any other references? $\endgroup$ Jul 9, 2013 at 7:16

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

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