A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Solving Systems of Difference Constraints Incrementally

1999
*
Algorithmica
*

Difference constraints systems consisting of inequalities of the form x i − x j ≤ b i, j occur in many applications, most notably those involving temporal reasoning. Often, it is necessary to maintain a solution to such a system as constraints are added, modified, and deleted. Existing algorithms handle modifications by solving the resulting system anew each time, which is inefficient. The best known algorithm to determine if a system of difference constraints is feasible (i.e., if it has a

doi:10.1007/pl00009261
fatcat:lkdcxv2zrbef7ov46k6evpxdmi