Speeding Up Dynamic Shortest-Path Algorithms-Reference-Cited by-同舟云学术

Speeding Up Dynamic Shortest-Path Algorithms

Published:2008-05 Issue:2 Volume:20 Page:191-204
ISSN:1091-9856
Container-title:INFORMS Journal on Computing
language:en
Short-container-title:INFORMS Journal on Computing

Author:

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

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

General Engineering

Link

https://pubsonline.informs.org/doi/pdf/10.1287/ijoc.1070.0231

Reference20 articles.

1. A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing

2. Shortest paths algorithms: Theory and experimental evaluation

3. Demetrescu C. Fully dynamic algorithms for path problems on directed graphs (2001) PhD thesis, Department of Computer and Systems Science, University of Rome “La Sapienza,” Rome

4. Fully dynamic all pairs shortest paths with real edge weights

Cited by 37 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Column generation for the collaborative multi-stop truckload shipping problem in daily regional distribution;Transportmetrica A: Transport Science;2024-07-17

2. Problem characterization of unique shortest path routing;Computers & Industrial Engineering;2023-04

3. Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide;ACM Journal of Experimental Algorithmics;2022-12-13

4. Reoptimizing Shortest Paths;Encyclopedia of Optimization;2022-11-23

5. Dynamic Network Tomography with Sparse Recovery-based Link Delay Estimation;2022 IEEE 8th World Forum on Internet of Things (WF-IoT);2022-10-26