Keyphrases
Metric Space
63%
Weighted Graph
54%
Spanners
52%
Metric Embedding
49%
Hopsets
48%
Shortest Path
46%
Spanning Tree
36%
Light Spanners
33%
Edge Weight
32%
Distance Oracles
31%
Doubling Metrics
30%
Euclidean Space
29%
Undirected Weighted Graph
29%
K Parameter
28%
Dimensionality Reduction
27%
Minimum Spanning Tree
26%
T-spanner
25%
Log-log
25%
Number of Edges
25%
Unweighted Graph
24%
Approximate Shortest Paths
23%
Low-dimensional Embedding
23%
Metric Structures
23%
Linear Size
23%
Additive Spanners
23%
Average Distortion
23%
Emulator
22%
Ultrametric
21%
Doubling Constant
20%
All-pairs
20%
Near-optimal
20%
Normed Space
18%
Centralized Algorithm
17%
Low-stretch Spanning Trees
17%
Distributed Construction
17%
Deterministic Algorithm
17%
Local Embedding
17%
Routing Scheme
17%
General Metric
15%
Approximation Algorithms
15%
Greedy Algorithm
14%
Strong Diameter
14%
Scaling Distortion
14%
Distributed Algorithms
14%
Intrinsic Dimension
14%
Path Reporting
13%
Routing Table
13%
Metric Data
13%
Polylogarithmic Time
13%
Tight
13%
Computer Science
Metric Space
100%
Weighted Graph
86%
Spanning Tree
49%
Efficient Algorithm
37%
Directed Graph
37%
Approximation (Algorithm)
36%
Minimum Spanning Tree
31%
Subgraphs
29%
Distributed Algorithm
24%
Embedding Distortion
23%
routing scheme
22%
Data Structure
20%
Distributed Computing
19%
Positive Parameter
17%
Preprocessing Time
17%
Model of Computation
16%
Approximation Algorithm
15%
Fundamental Problem
14%
Constant Factor
14%
Randomized Algorithm
14%
Lower Dimensional Space
13%
Maximal Matching
11%
Distinct Point
11%
Efficient Implementation
11%
Distributed Model
11%
Input Parameter
11%
Matrix Multiplication
11%
Embedding Theory
11%
Graph Algorithm
11%
Optimal Routing
11%
Labeling Scheme
11%
Planar Graph
8%
on-line algorithm
8%
Cardinality
8%
Greedy Algorithm
6%
Application Area
6%
Time Requirement
5%
Geodesics
5%
Routing Problem
5%
Memory Requirement
5%
Dimensionality Reduction
5%
Approximate Computing
5%
Sketching Algorithms
5%
Internet Latency
5%
Parallel Computation
5%
Shortest Path Computation
5%
Centralized Model
5%
Space Requirement
5%
Unified Framework
5%
Computer Science
5%
Mathematics
Edge
89%
Metric Space
70%
Weighted Graph
48%
Euclidean Space
35%
Approximates
35%
Spanning Tree
33%
Worst Case
27%
Running Time
27%
Minimum Spanning Tree
26%
Normed Space
24%
Polynomial
23%
Cardinality
19%
Weighted Undirected Graph
18%
Open Problem
17%
Set Point
17%
Lower and upper bounds
17%
Dimensional Space
16%
Free Graph
14%
Positive Parameter
14%
Model of Computation
14%
Main Result
12%
Matrix Multiplication
11%
Metric Graphs
11%
Stochastics
11%
Path Decomposition
11%
Lossless
11%
Concludes
11%
Additive Error
10%
Integer
10%
Finite Metric Space
9%
Planar Graph
9%
Data Structure
8%
Robustness Property
7%
Total Weight
7%
Constant Factor
7%
Greedy Algorithm
7%
Upper Bound
5%
Permutation
5%
Sharp Contrast
5%
Counterexample
5%
Bi-Lipschitz Embedding
5%
Wasserstein Distance
5%
Embedding Theorem
5%
Linear Programming
5%
Lp-Spaces
5%
Clique
5%
Dynamic Algorithms
5%
Constant Time
5%
Dimensionality Reduction
5%
Topological Property
5%
