Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks

Authors:
Camil Demetrescu;Giuseppe F. Italiano
Affiliations:
Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, Roma, Italy;Dipartimento di Informatica, Sistemi e Produzione, Università di Roma “Tor Vergata”, Roma, Italy
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 20
Cited 0

A dynamization of the all pairs least cost path problem

Proceedings on STACS 85 2nd annual symposium on theoretical aspects of computer science
High probability parallel transitive-closure algorithms

SIAM Journal on Computing
Incremental algorithms for minimal length paths

Journal of Algorithms
On the computational complexity of dynamic graph problems

Theoretical Computer Science
An incremental algorithm for a generalization of the shortest-path problem

Journal of Algorithms
Faster shortest-path algorithms for planar graphs

Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Randomized fully dynamic graph algorithms with polylogarithmic time per operation

Journal of the ACM (JACM)
An On-Line Edge-Deletion Problem

Journal of the ACM (JACM)
Fully dynamic algorithms for maintaining shortest paths trees

Journal of Algorithms
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity

Journal of the ACM (JACM)
Mathematics for the Analysis of Algorithms

Mathematics for the Analysis of Algorithms
All pairs shortest paths using bridging sets and rectangular matrix multiplication

Journal of the ACM (JACM)
Maintaining Minimum Spanning Forests in Dynamic Graphs

SIAM Journal on Computing
Fully dynamic biconnectivity and transitive closure

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Planar Graphs, Negative Weight Edges, Shortest Paths, and Near Linear Time

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Experimental analysis of dynamic all pairs shortest path algorithms

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A new approach to dynamic all pairs shortest paths

Journal of the ACM (JACM)
Worst-case update times for fully-dynamic all-pairs shortest paths

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Fully dynamic all pairs shortest paths with real edge weights

Journal of Computer and System Sciences - Special issue on FOCS 2001

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we survey algorithms for shortest paths in dynamic networks. Although research on this problem spans over more than three decades, in the last couple of years many novel algorithmic techniques have been proposed. In this survey, we will make a special effort to abstract some combinatorial and algebraic properties, and some common data-structural tools that are at the base of those techniques. This will help us try to present some of the newest results in a unifying framework so that they can be better understood and deployed also by non-specialists.