English

Turnpike with Uncertain Measurements: Triangle-Equality ILP with a Deterministic Recovery Guarantee

Computational Geometry 2026-03-20 v1 Data Structures and Algorithms Optimization and Control

Abstract

We study Turnpike with uncertain measurements: reconstructing a one-dimensional point set from an unlabeled multiset of pairwise distances under bounded noise and rounding. We give a combinatorial characterization of realizability via a multi-matching that labels interval indices by distinct distance values while satisfying all triangle equalities. This yields an ILP based on the triangle equality whose constraint structure depends only on the two-partition set Py={(r,s,t):yr+ys=yt}\mathcal{P}_y=\{(r,s,t): y_r+y_s=y_t\} and a natural LP relaxation with {0,1}\{0,1\}-coefficient constraints. Integral solutions certify realizability and output an explicit assignment matrix, enabling an assignment-first, regression-second pipeline for downstream coordinate estimation. Under bounded noise followed by rounding, we prove a deterministic separation condition under which Py\mathcal{P}_y is recovered exactly, so the ILP/LP receives the same combinatorial input as in the noiseless case. Experiments illustrate integrality behavior and degradation outside the provable regime.

Keywords

Cite

@article{arxiv.2603.18283,
  title  = {Turnpike with Uncertain Measurements: Triangle-Equality ILP with a Deterministic Recovery Guarantee},
  author = {C. S. Elder and Guillaume Marçais and Carl Kingsford},
  journal= {arXiv preprint arXiv:2603.18283},
  year   = {2026}
}

Comments

16 pages, 4 figures