Almost Shortest Paths with Near-Additive Error in Weighted Graphs.
Michael ElkinYuval GitlitzOfer NeimanPublished in: SWAT (2022)
Keyphrases
- weighted graph
- shortest path
- additive error
- worst case
- lower bound
- asymptotically optimal
- response time
- range queries
- upper bound
- graph partitioning
- road network
- shortest path algorithm
- geodesic distance
- multi dimensional
- edge weights
- spanning tree
- np hard
- finding the shortest path
- learning algorithm
- feature extraction