What algorithms do you know for beltway reconstruction?

Question

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?

See also the MO question Difference Sets, which also discusses the beltway reconstruction problem. — Joseph O'Rourke, Jul 09 '13 at 10:42

score 1 · Accepted Answer · answered Jul 09 '13 at 07:09

1

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

answered Jul 09 '13 at 07:09

Waldemar

1,107

Thanks. I've read these two papers: ___Reconstruction of Integers from Pairwise Distances___ & ___Reconstructing Sets From Interpoint Distances___. Any other references? – Mahdi Khosravi Jul 09 '13 at 07:16

What algorithms do you know for beltway reconstruction?

1 Answers1