Solving systems of difference constraints incrementally

Algorithmica (New York)

Volumn 23, Issue 3, 1999, Pages 261-275

  Ramalingam, G ^a   Song, J ^a   Joskowicz, L ^b   Miller, R E ^c  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c University of Maryland ^*  (United States)

Author keywords

Difference constraints; Dynamic negative cycle; Incremental algorithm; Linear constraints; Shortest path problem

Indexed keywords

EID: 0037854898     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009261     Document Type: Article

References (27)

1. B. Alpern, R. Hoover, B. K. Rosen, P. F. Sweeney, and F. K. Zadeck. Incremental evaluation of computational circuits. In Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pages 32-42, 1990.
2. B. Aspvall and Y. Shiloach. A polynomial algorithm for solving systems of linear
3. M. C. Buchanon and P. T. Zellweger. Automatically generating consistent schedules for multimedia document. Multimedia Systems Journal, 1:55-67, 1993.
4. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.
5. R. Dechter, I. Meiri, and J. Pearl. Temporal constraint network. Artificial Intelligence, 49:61-95, 1991.
6. J. R. Driscoll, H. N. Gabow, R. Shrairman, and R. E. Tarjan. Relaxed heaps: an alternative to fibonacci heaps with applications to parallel computatio. Communications of the ACM, 31(11):1343-1354, 1988.
7. J. Edmonds and R. M. Karp. Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM, 19:248-264, 1972.
8. M. L. Fredman and D. E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science, Volume II, pages 719-725. IEEE Computer Society Press, Los Alamitos, CA, 1990.
9. D. Frigoni, A. Marchetti-Spaccamela, and U. Nanni. Incremental algorithms for the single-source shortest path problem. In P. S. Thiagarajan, editor, Proceedings of the Fourteenth FST&TCS Conference, Lecture Notes in Computer Science, Volume 880, pages 113-124. Springer-Verlag, Berlin, 1994.
10. D. Frigoni, A. Marchetti-Spaccamela, and U. Nanni. Fully dynamic output bounded single source shortest path problem. In Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 212-221, 1996.
11. D. S. Hochbaum and J. Naor. Simple and fast algorithms for linear and integer programs with two variables per inequality. SIAM Journal on Computing, 23(6):1179-1192, 1994.
12. S. Hong and R. Gerber. Compiling real-time programs into schedulable code. In Proceedings of the ACM SIGPLAN '93 Conference on Programming Language Design and Implementation, pages 166-176, 1993.
13. J. Jaffar, M.J. Maher, P.J. Stuckey, and R.H.C. Yap. Beyond finite domains. In Proceedings of Workshop on Principles and Practice of Constraint Programming, pages 86-94, 1994.
14. M. Kim and J. Song. Multimedia documents with elastic time. In Proceedings of the ACM Multimedia Conference '95, pages 143-154, 1995.
15. I. Lee and V. Gehlot. Language constructs for real time programming. In Proceedings of the IEEE Real Time Systems Symposium, pages 57-66, 1985.
16. I. Meiri. Combining qualitative and quantitative constraints in temporal reasoning. Artificial Intelligence, 87:343-385, 1996.
17. V. Nirkhe, S. Tripathi, and A. Agrawala. Language support for the maruti real-time systems. In Proceedings of IEEE Real Time Systems Symposium, 1990.
18. L. Pape. Des Systemes d'Ordonnancement Flexibles et Opportunistes. Ph.D. thesis, Universite de Paris-Sud, 1988.
19. V.R. Pratt. Two easy theories whose combination is hard. Technical report, Massachusetts Institute of Technology, September 1977.
20. G. Ramalingam. Bounded Incremental Computation. Volume 1089. Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1996.
21. G. Ramalingam and T. Reps. An incremental algorithm for a generalization of the shortest-path problem. Journal of Algorithms, 21:267-305, 1996.
22. G. Ramalingam and T. Reps. On the computational complexity of dynamic graph problems. Theoretical Computer Science, 158:233-277, 1996.
23. R. Shostak. Deciding linear inequalities by computing loop residues. Journal of the ACM, 28:769-779, 1981.
24. J. Song, M. Kim, R. Miller, G. Ramalingam, and B. Yi. Interactive authoring of multimedia documents. In Proceedings of the 1996 Symposium on Visual Languages, pages 276-283, September 1996.
25. R. E. Tarjan. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA. 1983.
26. R. E. Tarjan. Amortized computational complexity. SIAM Journal of Computing, 6(2):306-318, April 1985.
27. W. Wolfe, S. Davidson, and I. Lee. Rtc: language support for real-time concurrency. In Proceedings of the IEEE Real Time Systems Symposium, pages 43-52, 1991.