A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths

Uri Zwick

doi:10.1007/978-3-540-30551-4_78

A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths

Uri Zwick

School of Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

We present an O(n³√log log n/ log n) time algorithm for the All Pairs Shortest Paths (APSP) problem for directed graphs with real edge lengths. This improves, by a factor of about √log n, previous algorithms for the problem obtained by Fredman, Takaoka and Dobosiewicz.

Original language	English
Pages (from-to)	921-932
Number of pages	12
Journal	Lecture Notes in Computer Science
Volume	3341
DOIs	https://doi.org/10.1007/978-3-540-30551-4_78
State	Published - 2004

Access to Document

10.1007/978-3-540-30551-4_78

Cite this

@article{7f0d3a6d2f7f4f5f84603f272b91eb6d,

title = "A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths",

abstract = "We present an O(n3√log log n/ log n) time algorithm for the All Pairs Shortest Paths (APSP) problem for directed graphs with real edge lengths. This improves, by a factor of about √log n, previous algorithms for the problem obtained by Fredman, Takaoka and Dobosiewicz.",

author = "Uri Zwick",

year = "2004",

doi = "10.1007/978-3-540-30551-4_78",

language = "אנגלית",

volume = "3341",

pages = "921--932",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Verlag",

}

TY - JOUR

T1 - A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths

AU - Zwick, Uri

PY - 2004

Y1 - 2004

N2 - We present an O(n3√log log n/ log n) time algorithm for the All Pairs Shortest Paths (APSP) problem for directed graphs with real edge lengths. This improves, by a factor of about √log n, previous algorithms for the problem obtained by Fredman, Takaoka and Dobosiewicz.

AB - We present an O(n3√log log n/ log n) time algorithm for the All Pairs Shortest Paths (APSP) problem for directed graphs with real edge lengths. This improves, by a factor of about √log n, previous algorithms for the problem obtained by Fredman, Takaoka and Dobosiewicz.

UR - http://www.scopus.com/inward/record.url?scp=35048829333&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-30551-4_78

DO - 10.1007/978-3-540-30551-4_78

M3 - מאמר

AN - SCOPUS:35048829333

VL - 3341

SP - 921

EP - 932

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -

A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths

Abstract

Access to Document

Other files and links

Fingerprint

Cite this