Keyphrases
Metric Space
76%
Light Spanners
69%
Treewidth
56%
Spanners
43%
Shortest Path
37%
Minor-free Graphs
36%
Minor-free
34%
Spatial Voting
34%
Metric Embedding
34%
Greedy Spanner
33%
T-spanner
31%
Ramsey
31%
Planar Graph
30%
Weighted Graph
29%
Plurality Point
29%
Oracle
26%
Path Metric
26%
Near-optimal
24%
Distance Query
23%
Graph Spanners
23%
Euclidean Space
23%
Any Dimension
23%
Log-log
20%
Distance Labeling
20%
Clan
20%
Ultrametric
17%
Postdocs
17%
Steiner Point Removal
17%
Light Network
17%
Locality-sensitive
17%
Stochastic Decomposition
17%
Hop-constrained
17%
Computer Science Department
17%
Spanning Tree
17%
Competitive Ratio
17%
Reliable Spanners
17%
Approximate Nearest Neighbor Search
17%
Distributed Construction
17%
Distributed Algorithms
17%
Near-linear Time
17%
Streaming Data
17%
Static Data
17%
Approximation Scheme
17%
Condorcet
17%
Communication Model
17%
Label Size
17%
Graph Drawing
17%
Simultaneous Communication
17%
Dynamic Streaming
17%
Dynamic Stream
17%
Computer Science
Metric Space
100%
Planar Graph
52%
Data Structure
40%
Polynomial Time
38%
Computer Science
34%
Time Approximation Scheme
34%
Approximation (Algorithm)
26%
routing scheme
26%
Finite Multiset
23%
Sparsity
21%
Tree Graph
17%
Distributed Algorithm
17%
Spanning Tree
17%
Rigorous Proof
17%
Data Streaming
17%
Communication Model
17%
Experimental Result
17%
Competitive Ratio
17%
Vehicle Routing
17%
Construction Algorithm
17%
Independent Set
17%
Approximation Algorithms
17%
Routing Table Size
17%
Communication Protocol
17%
Sketching Technique
17%
Fundamental Problem
17%
Space Complexity
17%
weighted graph
15%
Network Design Problem
11%
near neighbor query
8%
Stepping Stone
5%
Theoretical Computer Science
5%
Subgraphs
5%
e-Mail
5%
Minimum Spanning Tree
5%
Efficient Algorithm
5%
Randomized Algorithm
5%
Embedding Distortion
5%
Quadratic Time
5%
Desirable Property
5%
Steiner Tree Problem
5%
Mathematics
Metric Space
76%
Planar Graph
39%
Approximates
38%
Free Graph
34%
Edge
34%
Euclidean Space
31%
Stochastics
30%
Condorcet
29%
Spanning Tree
26%
Polynomial Time
25%
Multiset
23%
Data Structure
21%
Dimensional Space
17%
Nearest Neighbor
17%
Frchet-Distance
17%
Worst Case
17%
Total Weight
17%
weighted graph
17%
Steiner Point
17%
Intersects
17%
Data Streaming
17%
Concludes
17%
Complexity Space
17%
Upper Bound
13%
Vehicle Routing Problem
13%
Extra Factor
11%
Euclidean Plane
11%
Minimum Spanning Tree
8%
Linear Time
8%
Normed Space
8%
Finite Subset
8%
Running Time
8%
Structural Property
8%
Robertson
8%
Pairwise Distance
8%
Tree Problem
8%
Multiplicative
8%
Set Point
5%
Higher Dimensions
5%
Dimensional Euclidean Space
5%
