Keyphrases
Competitive Ratio
100%
Online Algorithms
55%
Competitive Algorithm
43%
Randomized Algorithms
35%
Deterministic Algorithm
27%
Load Balancing
26%
Online Load Balancing
20%
Log-log
18%
Tight
17%
Approximation Algorithms
17%
Approximation Ratio
16%
Preemption
15%
Admission Control
15%
Parallel Comparison
14%
Greedy Algorithm
14%
Metric Space
14%
Maximum Load
13%
Adversary
12%
2-approximation
12%
P-norm
11%
Flow Time
10%
Output Port
10%
Identical Machines
10%
Tight Bounds
10%
Input Port
10%
Related Machines
9%
Unsplittable Flow
9%
Improved Algorithm
9%
Processing Time
9%
Virtual Circuit
8%
Online Problem
8%
Buffer Management
8%
Online Set Cover
8%
Optimization Problem
7%
Unsplittable Flow Problem
7%
Task Assignment
7%
Multi-queue Switch
7%
Preference Vector
7%
Disjoint Paths
7%
Hierarchical Clustering
7%
Non-preemptive
7%
Bin Packing Problem
7%
Polynomial-time Algorithm
7%
Clairvoyance
7%
Offline Algorithm
7%
Perfect Matching
7%
Parallel Machines
6%
Restricted Assignment
6%
Time Complexity
6%
Online Scheduling
6%
Computer Science
Competitive Ratio
95%
on-line algorithm
45%
Approximation (Algorithm)
34%
Randomized Algorithm
33%
Load Balancing
32%
Admission Control
22%
Approximation Ratio
17%
Processing Time
15%
Optimization Problem
15%
Load Balancing Problem
13%
Greedy Algorithm
13%
Constant Factor
12%
Approximation Algorithms
11%
Communication Network
11%
Buffer Management
11%
Metric Space
10%
Job Scheduling
10%
Scheduling Problem
9%
Virtual Circuit
8%
Time Complexity
8%
Performance Guarantee
8%
multi-processor
7%
Hierarchical Clustering
7%
Preemptive Scheduling
7%
Network Design
7%
Optical Network
7%
Parallel Machine
6%
Resource Allocation
6%
Linear Program
6%
Arriving Packet
6%
Classical Problem
6%
Single Machine
6%
Competitive Analysis
6%
Bin Packing Problem
6%
Polynomial Time
5%
Network Optimization
5%
Multiple Machine
5%
Output-Queued Switch
5%
Connection Request
5%
high speed network
5%
Objective Function
5%
Primal-Dual
5%
Multicasting
5%
Fundamental Problem
5%
approximation factor
5%
Mathematics
Competitive Ratio
96%
Minimizes
37%
Edge
30%
Greedy Algorithm
20%
Approximates
16%
Upper Bound
14%
Polynomial Time
14%
Metric Space
14%
Packing Problem
12%
Constant Factor
10%
Main Result
10%
Polynomial
10%
Objective Function
10%
Worst Case
9%
Single Machine
9%
Integer
9%
Perfect Matchings
8%
Probability Theory
8%
Open Question
7%
Lower and upper bounds
7%
Open Problem
7%
Arrival Time
7%
Control Problems
7%
Nash Equilibrium
6%
Convex Programming
6%
Rounding
6%
Path Problem
6%
Fixed Number
6%
Total Cost
5%
Network Optimization
5%
Departure Time
5%
Optical Networks
5%
Matrix (Mathematics)
5%
Hierarchical Clustering
5%
Combinatorial Algorithm
5%
