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