Keyphrases
Oblivious Routing
100%
Competitive Ratio
79%
Approximation Algorithms
75%
Log-log
42%
Online Algorithms
35%
Routing Scheme
29%
Congestion
27%
Sparsifier
24%
Metric Space
24%
Balanced Graph Partitioning
23%
Approximation Ratio
23%
Polynomial Time
23%
Reordering Buffer Management
23%
Data Management
23%
Undirected Graph
22%
General Network
22%
Routing Algorithm
22%
Competitive Algorithm
21%
Improved Approximation
20%
Management Challenges
20%
Directed Graph
18%
Expander
18%
Sparsest Cut
17%
Tight Bounds
17%
Reorder Buffer
17%
Routing Strategy
15%
Capacitated
14%
Expander Decomposition
14%
Hierarchical Decomposition
13%
General Metric Spaces
13%
Cost Function
13%
Arbitrary Network
12%
Convex Combination
12%
Graph Partitioning
12%
Undirected Network
12%
Time Constrained Scheduling
11%
Caching
11%
Low-distortion Embedding
11%
Balanced Partition
11%
Partition Problem
11%
Practical Algorithm
11%
Low-dimensional Space
11%
Line Network
11%
Hunters
11%
Pursuit-evasion
11%
Negative Type
11%
Block Operation
11%
Wardrop Equilibrium
11%
Fast Convergence
11%
Adaptive Sampling Strategy
11%
Computer Science
Competitive Ratio
94%
Approximation Algorithms
64%
on-line algorithm
62%
Approximation (Algorithm)
56%
routing scheme
48%
Directed Graphs
37%
Polynomial Time
29%
Routing Algorithm
28%
Data Management
26%
Metric Space
25%
Graph Partition
24%
Buffer Management
23%
Approximation Ratio
23%
Convex Combination
18%
Undirected Network
17%
Routing Strategy
17%
Network Topology
14%
Hierarchical Decomposition
13%
Online Network
13%
weighted graph
13%
routing path
12%
Fast Convergence
11%
Aggregation Function
11%
Clustering Graph
11%
Routing Problem
10%
Constant Factor
10%
Oblivious Algorithm
10%
Efficient Algorithm
9%
Scheduling Problem
9%
Directed Network
9%
Message Passing
8%
Communication Network
8%
Data Structure
8%
Arbitrary Network
7%
Planar Graph
7%
Construction Algorithm
7%
Linear Programming
7%
Scheduling Strategy
6%
Performance Guarantee
6%
Linear Program
6%
Communication Cost
6%
Fast Algorithm
6%
Maxflow
5%
Maximum Latency
5%
Polynomial Degree
5%
Spanning Tree
5%
Analysis of Algorithm
5%
Network Constraint
5%
Network Design
5%
Tree Decomposition
5%
Mathematics
Competitive Ratio
48%
Metric Space
40%
Edge
40%
Approximates
27%
Minimizes
27%
Polynomial Time
22%
Graph Partition
22%
Main Result
18%
Worst Case
17%
Bicriteria
16%
Constant Factor
16%
Data Structure
15%
Dimensional Space
13%
Dimensional Plane
13%
Adaptive Sampling
11%
Convex Combination
11%
Partitioning Problem
11%
Linear Time
11%
Multiplicative
11%
Nonuniform
11%
Euclidean Space
11%
Natural Generalization
9%
Rounding
8%
Running Time
8%
Random Noise
8%
Upper Bound
8%
Polynomial
8%
Simple Graph
7%
Planar Graph
7%
Hypergraphs
5%
Service Station
5%
Physical Model
5%
Integer
5%
Weighted Degree
5%
Stochastics
5%
Metric Graphs
5%
Square Root
5%
Speed Convergence
5%
Dynamic Algorithms
5%
Bounding Box
5%
Random Order
5%
Logarithmic Loss
5%
Optimal Number
5%
