Reoptimizing shortest paths consists in solving a sequence of shortest path problems, where
each problem differs only slightly from the previous one, because the origin node has been
changed, some arcs have been removed from the graph, or the cost of a subset of arcs has
been modified. Each problem could be simply solved from scratch, independently from the
previous one, by using either a label-correcting or a label-setting shortest path algorithm.
Nevertheless, a clever way to approach it is to design ad hoc algorithms that efficiently use�…

Reoptimizing Shortest Paths: from state-ofthe-art to new recent perspectives …
Reoptimizing Shortest Paths: from state-ofthe-art to new recent perspectives / Festa, P.. - (2016).
(Intervento presentato al convegno 18th International Conference on Transparent Optical
Networks - ICTON 2016 tenutosi a Trento, Italia nel 10-14 luglio 2016). … Reoptimizing
Shortest Paths: from state-ofthe-art to new recent perspectives / Festa, P.. - (2016). (Intervento
presentato al convegno 18th International Conference on Transparent Optical Networks�…