Algorithmic techniques for maintaining shortest routes in dynamic networks
| Venue: | Electronic Notes in Theoretical Computer Science |
| Citations: | 2 - 0 self |
BibTeX
@INPROCEEDINGS{Demetrescu_algorithmictechniques,
author = {Camil Demetrescu},
title = {Algorithmic techniques for maintaining shortest routes in dynamic networks},
booktitle = {Electronic Notes in Theoretical Computer Science},
year = {},
pages = {2007}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 nonspecialists. Key words: Dynamic networks, dynamic graph problems, dynamic shortest paths. 1
