Speeding Up Dynamic Shortest-Path Algorithms

Dynamic shortest-path algorithms update the shortest paths taking into account a change in an arc weight. This paper describes a new generic technique that allows the reduction of heap sizes used by several dynamic single-destination shortest-path algorithms. For unit weight changes, the updates can...

Full description

Bibliographic Details

Published in:	INFORMS journal on computing Vol. 20; no. 2; pp. 191 - 204
Main Authors:	Buriol, Luciana S, Resende, Mauricio G. C, Thorup, Mikkel
Format:	Journal Article
Language:	English
Published:	Linthicum INFORMS 01.05.2008 Institute for Operations Research and the Management Sciences
Subjects:	Algorithms Analysis Dijkstra's algorithm Dynamic programming dynamic shortest-path algorithms Graphs heaps Shortest path algorithms Studies trees Trees (Graph theory) United States
ISSN:	1091-9856, 1526-5528, 1091-9856
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!