Chan (Geometrically Weighted) (APSP on Geometrically Weighted Graphs All-Pairs Shortest Paths (APSP))

From Algorithm Wiki

Revision as of 07:55, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n^{2.{84}4})$

Space Complexity

$O(l n^{2})$ words

(Derived: Compute and store $2l$ $V \times V$ matrices)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2009

Reference

http://tmc.web.engr.illinois.edu/moreapsp.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Chan_(Geometrically_Weighted)_(APSP_on_Geometrically_Weighted_Graphs_All-Pairs_Shortest_Paths_(APSP))&oldid=46982"