Solving systems of difference constraints incrementally with bidirectional search

DOI10.1007/S00453-004-1081-6MaRDI QIDQ1889863zbMATH OpenOpenAlexFDO

Authors Yanyan Li, Jianjun Zhou, Martin Müller

Publication date 13 December 2004

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-004-1081-6

zbMATH Keywords

incremental algorithmshortest-path algorithm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Solving systems of difference constraints incrementally
• On the computational complexity of querying bounds on differences constraints
• scientific article; zbMATH DE number 4209573
• Incremental constraint deletion in systems of linear constraints
• Bounded incremental computation

Cited in

(2)

• Solving systems of difference constraints incrementally
• An ASP-based solver for parametrized-difference revision

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1889863)