Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

62

Voted

INFORMS
2008

favoriteEmaildiscussreport

44views more INFORMS 2008»

Speeding Up Dynamic Shortest-Path Algorithms

14 years 9 months ago

Speeding Up Dynamic Shortest-Path Algorithms

Download www2.research.att.com

Luciana S. Buriol, Mauricio G. C. Resende, Mikkel

Real-time Traffic

INFORMS 2008 |

claim paper

Related Content

» Speeding up Stochastic Dynamic Programming with ZeroDelay Convolution

» Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions

» An exact algorithm for the robust shortest path problem with interval data

» Batch Dynamic SingleSource ShortestPath Algorithms An Experimental Study

» Performance Evaluation of Using a Dynamic Shortest Path Algorithm in OLSRv2

» Engineering LabelConstrained ShortestPath Algorithms

» On Dynamic Shortest Paths Problems

» More Effective Crossover Operators for the AllPairs Shortest Path Problem

» Design and Analysis of Improved Shortest Path Tree Update for Network Routing

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2008
Where	INFORMS
Authors	Luciana S. Buriol, Mauricio G. C. Resende, Mikkel Thorup

Comments (0)