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 36 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

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

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

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

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

5. Approximating Dynamic Weighted Vertex Cover with Soft Capacities;Algorithmica;2021-11-16

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP