Keyphrases
Approximation Algorithms
100%
Approximation Factor
34%
Approximation Ratio
26%
Bandwidth Allocation
27%
Computation Tree
24%
Deterministic Algorithm
21%
Directed Graph
26%
Disjoint
14%
Due Date
28%
Feedback Set
16%
Fully Dynamic
19%
Generalized Assignment Problem
19%
Graph Drawing
14%
Greedy Algorithm
15%
Half-plane
19%
Improved Approximation
19%
Link Paths
19%
Log-log
43%
Longest Common Subsequence
14%
Maximal Independent Set
16%
Minimum Weight
22%
Monge Property
19%
Monotone
14%
Multiple Machines
14%
Non-preemptive
17%
NP-hard
33%
Number of Edges
17%
Number of Vertices
22%
Optimal Algorithm
17%
Optimization Problem
19%
Parallel Algorithm
36%
Path Graph
29%
Polynomial Time
27%
Polynomial-time Algorithm
26%
Postal Model
14%
Processing Time
31%
Quality of Service
19%
Randomized Algorithms
19%
Real-time Scheduling
39%
Release Time
33%
Resource Allocation
17%
Resource Allocation Problem
16%
Scheduling Problem
31%
Telephone
19%
Throughput Maximization
18%
Tight Bounds
22%
Time Algorithm
25%
Time Complexity
22%
Update Time
17%
VLSI Layout
14%
Computer Science
Adaptive Routing
9%
Allocation Problem
29%
Approximation (Algorithm)
46%
Approximation Algorithms
94%
approximation factor
34%
Approximation Ratio
28%
Assignment Problem
17%
Bandwidth Allocation
27%
Competitive Analysis
9%
Computation Tree
23%
Connected Network
9%
Constant Factor
22%
Convex Polygon
19%
Directed Acyclic Graph
19%
Directed Graphs
31%
Efficient Algorithm
35%
Encoding Stage
9%
Gateway Router
9%
Global Computing
16%
Greedy Algorithm
18%
Heterogeneous Network
9%
Interval Graph
33%
Message Passing
17%
multi-processor
14%
Multimedia
23%
Multiple Machine
14%
Networking Hardware
9%
Optical Network
24%
Optimal Algorithm
19%
Optimization Problem
13%
Parallel Algorithms
38%
Parallelization
9%
Parametric Search
9%
Passing System
14%
Polynomial Time
40%
Polynomial Time Algorithm
13%
polynomial-time algorithm
15%
Processing Time
29%
Quality of Service
21%
Quantization (Signal Processing)
19%
Randomized Algorithm
14%
Real Time Scheduling
39%
Resource Allocation
37%
Resource Requirement
13%
Scheduling Problem
29%
Spanning Tree
19%
Speed-up
9%
Telephone
19%
Time Approximation Scheme
14%
Time Complexity
19%
Mathematics
Angle Measure
9%
Approximates
40%
Arboricity
9%
Arithmetic Expression
9%
Aspect-Ratio
9%
Batch Size
9%
Clique
14%
Cloud Computing
12%
Constant Factor
29%
Convex Body
9%
Cost Function
13%
Directed Acyclic Graph
9%
Divide and Conquer
11%
Edge
63%
Embedding Problem
17%
Generalized Assignment Problem
17%
Graph Partition
9%
Greatest Common Divisor
9%
Greedy Algorithm
12%
Halfplane
19%
Higher Dimensions
9%
Huffman Code
9%
Independent Set
11%
Integer
30%
Intersects
11%
Interval Graph
31%
Linear Time
24%
Main Result
19%
Matrix (Mathematics)
11%
Median
12%
Minimizes
46%
Optical Networks
17%
Polygon
14%
Polynomial Time
78%
Programming Problem
9%
Real Life
9%
Spanning Tree
9%
Sparse Graphs
11%
Square Root
9%
Three-Dimension
9%
time interval τ
12%
Time Slot
17%
Time Unit
9%
Time Window
29%
Transportation Problem
9%
Traveling Salesman Problem
9%
Tree Problem
17%
Two Dimensions
14%
Upper Bound
12%
Wide Class
14%
