INFORMATION BOUNDS ARE WEAK IN THE SHORTEST DISTANCE PROBLEM

被引：24
|
作者：
GRAHAM, RL [1 ]
YAO, AC [1 ]
YAO, FF [1 ]
机构：
[1] STANFORD UNIV,DEPT COMP SCI,STANFORD,CA 94305
来源：
JOURNAL OF THE ACM | 1980年 / 27卷 / 03期
关键词：
D O I：
10.1145/322203.322206
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：428 / 444
页数：17
相关论文
共 50 条
  • [1] The inverse shortest paths problem with upper bounds on shortest paths costs
    Burton, D
    Pulleyblank, WR
    Toint, PL
    NETWORK OPTIMIZATION, 1997, 450 : 156 - 171
  • [2] Explicit inapproximability bounds for the shortest superstring problem
    Vassilevska, V
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2005, PROCEEDINGS, 2005, 3618 : 793 - 800
  • [3] Bounds and heuristics for the shortest capacitated paths problem
    Costa, MC
    Hertz, A
    Mittaz, M
    JOURNAL OF HEURISTICS, 2002, 8 (04) : 449 - 465
  • [4] Bounds and Heuristics for the Shortest Capacitated Paths Problem
    Marie-Christine Costa
    Alain Hertz
    Michel Mittaz
    Journal of Heuristics, 2002, 8 : 449 - 465
  • [5] New Lower and Upper Bounds for Shortest Distance Queries on Terrains
    Kaul, Manohar
    Wong, Raymond Chi-Wing
    Jensen, Christian S.
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2015, 9 (03): : 168 - 179
  • [6] A new exact algorithm for the shortest path problem: An optimized shortest distance matrix
    Yuan, Huilin
    Hu, Jianlu
    Song, Yufan
    Li, Yanke
    Du, Jie
    COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 158
  • [7] On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
    Lyubashevsky, Vadim
    Micciancio, Daniele
    ADVANCES IN CRYPTOLOGY - CRYPTO 2009, 2009, 5677 : 577 - +
  • [8] Correlation Distance and Bounds for Mutual Information
    Hall, Michael J. W.
    ENTROPY, 2013, 15 (09) : 3698 - 3713
  • [9] Improved length bounds for the shortest superstring problem (extended abstract)
    Armen, C
    Stein, C
    ALGORITHMS AND DATA STRUCTURES, 1995, 955 : 494 - 505
  • [10] On the shortest distance between orbits and the longest common substring problem
    Barros, Vanessa
    Liao, Lingmin
    Rousseau, Jerome
    ADVANCES IN MATHEMATICS, 2019, 344 : 311 - 339
12345