Keyphrases
Spanners
82%
Log-log
55%
Approximation Algorithms
51%
Shortest Path
48%
Weighted Graph
40%
Hopsets
39%
Near-optimal
36%
General Graphs
36%
Distributed Algorithms
36%
Linear Size
33%
Edge Weight
32%
Sparse Spanners
30%
Unweighted Graph
30%
Distance Oracles
29%
Euclidean Spanners
28%
Additive Spanners
28%
Maximum Degree
27%
Minimum Spanning Tree
24%
Approximate Shortest Paths
24%
Spanning Tree
24%
Radio Broadcast
23%
Centralized Algorithm
23%
Emulator
23%
Distributed Computing
22%
Polylogarithmic Time
22%
K Parameter
22%
Edge Coloring
22%
Vertex Coloring
22%
Unweighting
22%
Undirected Weighted Graph
21%
Preservers
20%
Distributed Protocol
20%
Broadcast Problem
20%
Distance Preservers
19%
Approximation Ratio
19%
Path Reporting
19%
Metric Structures
19%
Inapproximability
19%
Extended Abstracts
19%
Light-tree
19%
Low Light
19%
Telephone
19%
Graph Coloring
18%
Number of Edges
18%
Coloring Algorithm
17%
Tight
17%
All-pairs
17%
Distributed Construction
17%
Hop-diameter
16%
Peleg
16%
Computer Science
Minimum Spanning Tree
78%
Weighted Graph
66%
Distributed Algorithm
59%
Approximation (Algorithm)
57%
Distributed Computing
56%
Subgraphs
55%
Spanning Tree
52%
Approximation Algorithm
52%
Directed Graph
46%
Randomized Algorithm
45%
Coloring Problem
41%
Efficient Algorithm
36%
Message Passing
31%
Metric Space
27%
Graph Coloring
24%
Distributed Protocol
23%
Fundamental Problem
23%
Maximal Independent Set
23%
Model of Computation
23%
Constant Factor
22%
Iterative Algorithm
19%
Approximation Ratio
19%
Telephone
19%
routing scheme
18%
Approximate Computing
16%
Maximal Matching
16%
Communication Complexity
15%
Multicast Problem
15%
Data Structure
14%
Positive Parameter
14%
Client Server
14%
Preprocessing Time
14%
Labeling Scheme
13%
Spanning Tree Algorithm
12%
Graph Algorithm
12%
Processing Time
11%
Multiplicative Factor
11%
Network Design
10%
Computer Science
10%
Positive Integer
9%
Distinct Point
9%
Distributed Computation
9%
Optimal Routing
9%
Distributed Model
9%
Matrix Multiplication
9%
Space Requirement
9%
Shortest Path Problem
9%
Efficient Implementation
9%
Network Lifetime
9%
Communication Network
8%
Mathematics
Edge
100%
Running Time
92%
Minimum Spanning Tree
60%
Approximates
51%
Spanning Tree
46%
Weighted Graph
39%
Maximum Degree
32%
Independent Set
24%
Multiplicative
22%
Arboricity
18%
Metric Space
18%
Open Problem
15%
Weighted Undirected Graph
14%
Matrix Multiplication
14%
Discrete Geometry
14%
Constant Time
14%
Graph Coloring
14%
Model of Computation
14%
Constant Factor
13%
Normed Space
12%
Approximability
12%
Worst Case
12%
Positive Parameter
11%
Upper Bound
10%
Concludes
10%
Objective Function
9%
Combinatorial Algorithm
9%
Lossless
9%
Decomposition Algorithms
9%
Center Point
9%
Symmetry Breaking
9%
Euclidean Norm
9%
Steiner Point
9%
Additive Error
8%
Dimensional Euclidean Space
8%
Main Result
7%
Sparse Graphs
6%
Integer
6%
Defectives
6%
Set Point
6%
Arithmetic Progression
6%
Additive Number Theory
6%
Dense Subset
6%
Greedy Algorithm
6%
Tree Problem
5%
Data Structure
5%
Linear Time
5%
Polynomial
5%
Seminal Paper
5%
Designated Point
5%
