首页> 外文会议>STACS 2007; Lecture Notes in Computer Science; 4393 >Speed-Up Techniques for Shortest-Path Computations
【24h】

Speed-Up Techniques for Shortest-Path Computations

机译:最短路径计算的加速技术

获取原文
获取原文并翻译 | 示例

摘要

During the last years, several speed-up techniques for DIJK-STRA'S ALGORITHM have been published that maintain the correctness of the algorithm but reduce its running time for typical instances. They are usually based on a preprocessing that annotates the graph with additional information which can be used to prune or guide the search. Timetable information in public transport is a traditional application domain for such techniques. In this paper, we provide a condensed overview of new developments and extensions of classic results. Furthermore, we discuss how combinations of speed-up techniques can be realized to take advantage from different strategies.
机译:在过去的几年中,已经发布了多种DIJK-STRA算法的加速技术,这些技术可以保持算法的正确性,但可以减少典型实例的运行时间。它们通常基于预处理,该预处理使用可用于修剪或指导搜索的附加信息来注释图形。公共交通中的时间表信息是此类技术的传统应用领域。在本文中,我们简要概述了经典结果的新发展和扩展。此外,我们讨论了如何利用不同的策略来实现加速技术的组合。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号