Skip to main navigation
Skip to search
Skip to main content
Bar-Ilan University Home
Help & FAQ
Link opens in a new tab
Search content at Bar-Ilan University
Home
Researchers
Organisations
Research output
Prizes
Student theses
Courses
Activities
Projects
Press/Media
Datasets
Equipment
All-pairs shortest paths with a sublinear additive error
Liam Roditty
, Asaf Shapira
Department of Computer Science and Artificial Intelligence
Georgia Institute of Technology
Research output
:
Contribution to journal
›
Article
›
peer-review
14
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'All-pairs shortest paths with a sublinear additive error'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Shortest Path
100%
All-pairs Shortest Paths
100%
Additive Error
100%
Shortest Path Algorithm
50%
Integer Weights
50%
Approximation Algorithms
25%
Fast Algorithm
25%
Directed Graph
25%
Multiplicative Error
25%
Time Algorithm
25%
Positive Integer
25%
Fast Approximation Algorithms
25%
Shortest Path Distance
25%
Weighted Estimates
25%
Multiplicative Approximation
25%
Main Ingredients
25%
Computer Science
Approximation Algorithms
100%
Pair Shortest Path
100%
Shortest Path Algorithm
100%
Approximation (Algorithm)
50%
Directed Graphs
50%
Fast Algorithm
50%
Positive Integer
50%
Mathematics
Running Time
100%
Additive Error
100%
Multiplicative
66%
Integer
33%
Approximates
33%
Smallest Positive Integer
33%
Fast Algorithm
33%