Keyphrases
Query Response Time
44%
Shortest Path
41%
2-approximation
40%
All-pairs
38%
Undirected Graph
30%
Approximation Algorithms
29%
Sparse Graphs
28%
Disk Graph
28%
Time Algorithm
27%
Oracle
26%
Approximate Distance Oracles
26%
Distance Oracles
26%
Approximate Shortest Paths
22%
Expected Running Time
22%
Undirected Weighted Graph
22%
Fault-tolerant
19%
Algorithmic Trading
19%
Source Fault
19%
Computational Geometry
19%
Transmission Graph
19%
Stab
19%
Reachability Oracles
19%
Network Algorithms
19%
Wireless Networking
19%
Dynamic Algorithms
19%
Log 2
19%
Unified Approach
19%
Five-point
19%
Subquadratic
19%
Bivariate
19%
Tight
19%
Dynamic Connectivity
19%
Eccentricity
19%
Update Time
19%
Graph Diameter
19%
Efficient Construction
19%
Approximation Bound
19%
Lower Envelope
19%
Voronoi Diagram
19%
Shallow Cuttings
19%
General Distance Functions
19%
Algebraic Function
19%
Unweighting
17%
Planar Point Set
15%
Directed Graph
15%
Approximation Factor
15%
Approximate Distances
15%
Space-time Data
15%
Multiplicative Approximation
14%
Vertex Set
14%
Mathematics
Data Structure
100%
Approximates
76%
Edge
65%
Running Time
40%
Sparse Graphs
34%
Weighted Undirected Graph
28%
Multiplicative
24%
Planar Point
23%
Distance Function
19%
Linear Time
19%
Integer
12%
Intersects
12%
Fast Algorithm
12%
Exponential Time
11%
Tradeoff
9%
Open Question
9%
Worst Case
9%
Nonnegative Integer
9%
Intersection Graph
9%
Unit Disk
6%
Davenport-Schinzel Sequence
6%
Algebraic Function
5%
Nearest Neighbor
5%
Bivariate
5%
Computer Science
Data Structure
83%
Approximation (Algorithm)
68%
Directed Graphs
65%
Approximation Algorithms
24%
Sparsity
19%
Fault Tolerant
19%
Subgraphs
19%
Distance Function
19%
Computational Geometry
19%
Wireless Networking
19%
Preprocessing Time
9%
Labeling Scheme
9%
approximation factor
9%
Intersection Graph
9%
Fast Algorithm
7%