Solving systems of difference constraints incrementally

DOI10.1007/PL00009261zbMath0921.68011OpenAlexW2035305340MaRDI QIDQ1283935

K. Appert

Publication date: 30 March 1999

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009261

zbMATH Keywords

difference constraints systems

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (6)

The Linear Complementarity Problems with a Few Variables per Constraint ⋮ A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form ⋮ Planning wireless networks by shortest path ⋮ Integrating answer set programming and constraint logic programming ⋮ Depth-first discovery algorithm for incremental topological sorting of directed acyclic graphs ⋮ Maintaining longest paths incrementally

This page was built for publication: Solving systems of difference constraints incrementally