Shortest paths in matrix multiplication time

被引：0
|
作者：
Sankowski, P [1 ]
机构：
[1] Warsaw Univ, Inst Informat, PL-02097 Warsaw, Poland
来源：
ALGORITHMS - ESA 2005 | 2005年 / 3669卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
In this paper we present an (O) over tilde (Wn(w)) time algorithm solving single source shortest path problem in graphs with integer weights from the set {-W,..., 0,..., W}, where omega < 2.376 is the matrix multiplication exponent. For dense graphs with small edge weights, this result improves upon the algorithm of Goldberg that works in (O) over tilde (mn(0.5) log W) time, and the Bellman-Ford algorithm that works in O(nm) time.
引用
收藏
页码：770 / 778
页数：9
相关论文
共 50 条
  • [21] Shortest Paths between Shortest Paths and Independent Sets
    Kaminski, Marcin
    Medvedev, Paul
    Milanic, Martin
    COMBINATORIAL ALGORITHMS, 2011, 6460 : 56 - +
  • [22] Shortest Paths with Shortest Detours
    Torchiani, Carolin
    Ohst, Jan
    Willems, David
    Ruzika, Stefan
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2017, 174 (03) : 858 - 874
  • [23] Shortest Paths in Time-Dependent FIFO Networks
    Dehne, Frank
    Omran, Masoud T.
    Sack, Joerg-Ruediger
    ALGORITHMICA, 2012, 62 (1-2) : 416 - 435
  • [24] Shortest Paths in Time-Dependent FIFO Networks
    Frank Dehne
    Masoud T. Omran
    Jörg-Rüdiger Sack
    Algorithmica, 2012, 62 : 416 - 435
  • [25] Undirected single source shortest paths in linear time
    Thorup, M
    38TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1997, : 12 - 21
  • [26] Improved Approximation for Time-Dependent Shortest Paths
    Omran, Masoud
    Sack, Joerg-Ruediger
    COMPUTING AND COMBINATORICS, COCOON 2014, 2014, 8591 : 453 - 464
  • [27] Querying Shortest Paths on Time Dependent Road Networks
    Wang, Yong
    Li, Guoliang
    Tang, Nan
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2019, 12 (11): : 1249 - 1261
  • [28] Shortest paths on a polyhedron .1. Computing shortest paths
    Chen, JD
    Han, YJ
    INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1996, 6 (02) : 127 - 144
  • [29] Models and algorithms for shortest paths in a time dependent network
    Li, Yinzhen
    He, Ruichun
    Zhang, Zhongfu
    Gu, Yaohuang
    OPERATIONS RESEARCH AND ITS APPLICATIONS, 2005, 5 : 319 - 328
  • [30] Time-dependent shortest paths with discounted waits
    Omer, Jeremy
    Poss, Michael
    NETWORKS, 2019, 74 (03) : 287 - 301
12345