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?



What algorithms do you know for beltway reconstruction?
A relatively recent result for a sparse case can be found [here](http://arxiv.org/pdf/1212.2386v1.pdf) (see Algorithm 2). It’s a probabilistic polynomial-time algorithm.


