APSP on Geometrically Weighted Graphs: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
No edit summary
No edit summary
Line 30: Line 30:
|}
|}


== Time Complexity graph ==  
== Time Complexity Graph ==  


[[File:All-Pairs Shortest Paths (APSP) - APSP on Geometrically Weighted Graphs - Time.png|1000px]]
[[File:All-Pairs Shortest Paths (APSP) - APSP on Geometrically Weighted Graphs - Time.png|1000px]]


== Space Complexity graph ==  
== Space Complexity Graph ==  


[[File:All-Pairs Shortest Paths (APSP) - APSP on Geometrically Weighted Graphs - Space.png|1000px]]
[[File:All-Pairs Shortest Paths (APSP) - APSP on Geometrically Weighted Graphs - Space.png|1000px]]


== Pareto Decades graph ==  
== Pareto Frontier Improvements Graph ==  


[[File:All-Pairs Shortest Paths (APSP) - APSP on Geometrically Weighted Graphs - Pareto Frontier.png|1000px]]
[[File:All-Pairs Shortest Paths (APSP) - APSP on Geometrically Weighted Graphs - Pareto Frontier.png|1000px]]

Revision as of 13:04, 15 February 2023

Description

In this case, the graph $G=(V,E)$ that we consider may be dense or sparse, may be directed or undirected, and has weights from a fixed set of $c$ values.

Related Problems

Generalizations: APSP

Related: APSP on Dense Directed Graphs with Arbitrary Weights, APSP on Dense Undirected Graphs with Arbitrary Weights, APSP on Dense Undirected Graphs with Positive Integer Weights, APSP on Sparse Directed Graphs with Arbitrary Weights, APSP on Sparse Undirected Graphs with Positive Integer Weights, APSP on Sparse Undirected Graphs with Arbitrary Weights, APSP on Dense Directed Unweighted Graphs, APSP on Dense Undirected Unweighted Graphs, APSP on Sparse Directed Unweighted Graphs, APSP on Sparse Undirected Unweighted Graphs, (5/3)-approximate ap-shortest paths

Parameters

n: number of vertices

m: number of edges

c: number of weights

Table of Algorithms

Name Year Time Space Approximation Factor Model Reference
Chan (Geometrically Weighted) 2009 $O(V^{2.{84}4})$ $O(l V^{2})$ Exact Deterministic Time

Time Complexity Graph

All-Pairs Shortest Paths (APSP) - APSP on Geometrically Weighted Graphs - Time.png

Space Complexity Graph

All-Pairs Shortest Paths (APSP) - APSP on Geometrically Weighted Graphs - Space.png

Pareto Frontier Improvements Graph

All-Pairs Shortest Paths (APSP) - APSP on Geometrically Weighted Graphs - Pareto Frontier.png