Nanda Kambhatla
ACL 2004
Suppose we are given a (possibly redundant) system of linear equalities and linear inequalities, C, and a solved form for C, and we now delete a constraint from C. We give an algorithm to incrementally compute a solved form for this new system. The algorithm has cost O(n2) where n is the number of constraints in C, while computing the solved form directly has expected cost O(n3). To our knowledge this is the first incremental algorithm for (re)computing a solved form after deleting a constraint. © 1995.
Nanda Kambhatla
ACL 2004
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000
Matthias Kaiserswerth
IEEE/ACM Transactions on Networking
Elliot Linzer, M. Vetterli
Computing