Abstract
Given a digraph and a cost function of the edges we update on-line, i.e., between two successive modifications of the cost function, the solution of the All Pairs Least Cost Path Problem (APLCPP). We derive lower and upper bounds for time complexity and show that the gaps between two corresponding bounds are small. Space complexity is quadratic and therefore optimal in our model.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
5. References
S. EVEN/Y. SHILOACH: "An On-Line Edge-Deletion Problem" JACM, vol. 28, no. 1, 1981
G.N. FREDERICKSON: "Data Structures for On-Line Updating of Minimum Spanning Trees", CACM, 1983
T. IBARAKI/N. KATOH: "On-Line Computation of Transitive Closure of Graphs", Inf.Proc.Let. 16, 1983
D.B. JOHNSON:"Efficient Algorithms for Shortest Paths in Sparse Networks, JACM, vol. 24, no. 1, 1977
K. MEHLHORN: "Data Structures and Algorithms", Springer-Verlag Berlin-Heidelberg-New York-Tokyo, Vol. I and II
V.V. RODIONOV: "The Parametric Problem of Shortest Distances", U.S.S.R. Comput.Math.Math.Phys., 8, 336–343, 1968
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rohnert, H. (1984). A dynamization of the All Pairs Least Cost Path Problem. In: Mehlhorn, K. (eds) STACS 85. STACS 1985. Lecture Notes in Computer Science, vol 182. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024016
Download citation
DOI: https://doi.org/10.1007/BFb0024016
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13912-6
Online ISBN: 978-3-540-39136-4
eBook Packages: Springer Book Archive