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

Uri Zwick

doi:10.1007/s00453-005-1199-1

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

Uri Zwick^*

^*Corresponding author for this work

School of Computer Science

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

9 Scopus citations

Abstract

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

Original language	English
Pages (from-to)	181-192
Number of pages	12
Journal	Algorithmica
Volume	46
Issue number	2
DOIs	https://doi.org/10.1007/s00453-005-1199-1
State	Published - Oct 2006

Keywords

Addition-comparison model
Bit-level parallelism
Decision trees
Min-plus Products
Shortest pasth

Access to Document

10.1007/s00453-005-1199-1

Cite this

@article{67f784aaaea0482f974336cb50216814,

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/logn)-time algorithm for the All Pairs Shortest Paths (APSP) problem for directed graphs with real edge lengths. This slightly improves previous algorithms for the problem obtained by Fredman, Dobosiewicz, Han, and Takaoka.",

keywords = "Addition-comparison model, Bit-level parallelism, Decision trees, Min-plus Products, Shortest pasth",

author = "Uri Zwick",

year = "2006",

month = oct,

doi = "10.1007/s00453-005-1199-1",

language = "אנגלית",

volume = "46",

pages = "181--192",

journal = "Algorithmica",

issn = "0178-4617",

publisher = "Springer New York",

number = "2",

}

TY - JOUR

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

AU - Zwick, Uri

PY - 2006/10

Y1 - 2006/10

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

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

KW - Addition-comparison model

KW - Bit-level parallelism

KW - Decision trees

KW - Min-plus Products

KW - Shortest pasth

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

U2 - 10.1007/s00453-005-1199-1

DO - 10.1007/s00453-005-1199-1

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:33748573343

SN - 0178-4617

VL - 46

SP - 181

EP - 192

JO - Algorithmica

JF - Algorithmica

IS - 2

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this