Solving Systems of Difference Constraints Incrementally with Bidirectional Search

Abstract

Abstract. We propose an incremental algorithm for the problem of maintaining systems of difference constraints. As a difference from the unidirectional approach of Ramalingam et al. [16], it employs bidirectional search, which is similar to that of Alpern et al. [1], and has a bounded runtime complexity in the worst case in terms of the size of changes. The major challenge is how to update the solution efficiently after the bidirectional search discovers a region that needs changes. Experimental results show that our approach is much faster in runtime and generates much smaller changes than the algorithm in [16]. We also perform an experimental study on the edge value heuristic [1] and results show that a simpler method may be faster in practice.

Feature dimensionality reduction: a review

“…Using this method to solve the model, the goal of coordinated optimization of power plants was achieved. Zhou proposed an incremental algorithm for differential constraint systems [31] and the bi-directional search was used in it. Experimental results show that this method is much faster than a one-way search.…”