Fast approximate shortest paths in the congested clique

Keyphrases

• Approximate Shortest Paths 100%
• Congested Clique 100%
• Undirected Weighted Graph 100%
• 2-approximation 50%
• Deterministic Algorithm 50%
• Polynomial-time Algorithm 50%
• All-pairs Shortest Paths 50%
• Improved Algorithm 50%
• Sparse Matrix multiplication 50%
• Weighted Graph 50%
• Constant-factor Approximation Algorithm 50%
• Multi-source 50%
• Undirected Graph 50%
• Shortest Path 50%
• Unweighting 50%
• Hopsets 50%
• Shortest Path Problem 50%
• Distance Problems 50%
• Single-source Shortest Paths 50%
• Shortest Path Algorithm 50%
• Additive Factors 50%
• Distance Computation 50%
• Polynomial Constant 50%

Mathematics

• Approximates 100%
• Polynomial 100%
• Clique 100%
• Path Problem 66%
• Weighted Undirected Graph 66%
• Matrix Multiplication 33%
• Sparse Matrix 33%
• Constant Factor 33%
• weighted graph 33%

Computer Science

• Approximation (Algorithm) 100%
• Directed Graphs 60%
• Pair Shortest Path Problem 20%
• Matrix Multiplication 20%
• Constant Factor 20%
• weighted graph 20%
• Polynomial Constant 20%
• Polynomial Algorithm 20%
• Shortest Path Algorithm 20%
• Shortest Path Problem 20%