Faster approximation of distances in graphs

Keyphrases

• Shortest Path 100%
• Fast Approximation 100%
• Distance Graph 100%
• Boolean Matrix multiplication 100%
• 2-approximation 100%
• All-pairs Shortest Paths 100%
• Separator 50%
• Deterministic Algorithm 50%
• Error Term 50%
• Approximation Algorithms 50%
• Edge Weight 50%
• Problematic Use 50%
• Additive Error 50%
• Approximation Problem 50%
• Multiplicative Factors 50%
• Undirected Weighted Graph 50%
• Path Metric 50%

Computer Science

• Approximation (Algorithm) 100%
• Matrix Multiplication 100%
• Boolean Matrix 100%
• Approximation Algorithms 50%
• Directed Graphs 50%
• Pair Shortest Path Problem 50%
• Approximation Problem 50%
• Multiplicative Factor 50%
• Pair Shortest Path 50%

Mathematics

• Edge 100%
• Matrix Multiplication 100%
• Error Term 50%
• Path Problem 50%
• Analogous Result 50%
• Additive Error 50%
• Multiplicative 50%
• Weighted Undirected Graph 50%
• Approximation Problem 50%