All pairs almost shortest paths

被引：18
|
作者：
Dor, D [1 ]
Halperin, S [1 ]
Zwick, U [1 ]
机构：
[1] TEL AVIV UNIV,DEPT COMP SCI,IL-69978 TEL AVIV,ISRAEL
来源：
37TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS | 1996年
关键词：
D O I：
10.1109/SFCS.1996.548504
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：452 / 461
页数：10
相关论文
共 50 条
  • [21] All-Pairs Shortest Paths with a Sublinear Additive Error
    Roditty, Liam
    Shapira, Asaf
    ACM TRANSACTIONS ON ALGORITHMS, 2011, 7 (04)
  • [22] Distributed Weighted All Pairs Shortest Paths Through Pipelining
    Agarwal, Udit
    Ramachandran, Vijaya
    2019 IEEE 33RD INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS 2019), 2019, : 23 - 32
  • [23] All-pairs shortest paths computation in the BSP model
    Tiskin, A
    AUTOMATA LANGUAGES AND PROGRAMMING, PROCEEDING, 2001, 2076 : 178 - 189
  • [24] Two fast algorithms for all-pairs shortest paths
    Duin, C. W.
    COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (09) : 2824 - 2839
  • [25] All-Pairs Shortest Paths in Geometric Intersection Graphs
    Chan, Timothy M.
    Skrepetos, Dimitrios
    ALGORITHMS AND DATA STRUCTURES: 15TH INTERNATIONAL SYMPOSIUM, WADS 2017, 2017, 10389 : 253 - 264
  • [26] Faster Deterministic All Pairs Shortest Paths in CONGEST Model
    Agarwal, Udit
    Ramachandran, Vijaya
    PROCEEDINGS OF THE 32ND ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA '20), 2020, : 11 - 21
  • [27] Computing Almost Shortest Paths
    Elkin, Michael
    ACM TRANSACTIONS ON ALGORITHMS, 2005, 1 (02) : 283 - 323
  • [28] Efficient parameterized algorithms for computing all-pairs shortest paths
    Kratsch, Stefan
    Nelles, Florian
    DISCRETE APPLIED MATHEMATICS, 2023, 341 : 102 - 119
  • [29] Fast 2-Approximate All-Pairs Shortest Paths
    Dory, Michal
    Forster, Sebastian
    Kirkpatrick, Yael
    Nazari, Yasamin
    Williams, Virginia Vassilevska
    de Vos, Tijn
    PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 4728 - 4757
  • [30] On the comparison-addition complexity of all-pairs shortest paths
    Department of Computer Sciences, University of Texas at Austin, Austin, TX 78712, United States
    Lect. Notes Comput. Sci., (32-43):
12345