1 paper
Lucas Kletzander, Jip J. Dekker, Andreas Schutt +1
Difference constraints of the form x−y≤d are well studied, with efficient algorithms for satisfaction and implication, because of their connection to shortest paths. Finit…