Mathematics
Scheduling
39%
Parallel Algorithms
37%
Computing
33%
Approximation Algorithms
32%
Efficient Algorithms
29%
Graph in graph theory
28%
Monge Property
27%
Throughput
26%
Strings
22%
Schedule
21%
Approximation
21%
Lower bound
21%
Resource Allocation
20%
Path
19%
Dynamic Pricing
19%
Costs
18%
Real-time
18%
Metric
17%
Vertex of a graph
16%
Batching
16%
RNA Secondary Structure
16%
Directed Graph
15%
Suffix Tree
15%
Advertising
15%
Logarithmic
15%
Longest Common Subsequence
15%
Graph Partitioning
14%
Competitiveness
13%
Preprocessing
13%
Bandwidth Allocation
13%
Parallelization
13%
Separator
12%
Model
12%
Paging
12%
Minimise
12%
Alignment
12%
Profit
12%
Subset
12%
Convex polygon
12%
Multimedia
11%
Query
11%
Optimal Algorithm
11%
Spanning tree
11%
Travelling salesman problems
11%
Greedy Algorithm
11%
All-optical Networks
11%
Dynamic Programming
11%
Simplification
11%
Engineering & Materials Science
Approximation algorithms
100%
Scheduling
73%
Parallel algorithms
41%
Polynomials
37%
NP-hard
33%
Resource allocation
29%
Frequency allocation
28%
Directed graphs
25%
Throughput
24%
Fiber optic networks
21%
Costs
20%
Telephone
19%
Quality of service
17%
Bins
17%
Random access storage
17%
Servers
15%
Profitability
15%
Graph algorithms
13%
Multicasting
13%
Radiotherapy
13%
Trees (mathematics)
13%
Traveling salesman problem
12%
Separators
11%
Message passing
11%
Heterogeneous networks
11%
Broadcasting
10%
Scheduling algorithms
10%
Aspect ratio
9%
Set theory
9%
Bandwidth
8%
Communication
8%
Decomposition
8%
Color
8%
Communication systems
8%
Wavelength
8%
Feedback
7%
Testing
7%
Routing algorithms
7%
Rational functions
7%
Relaxation
6%
Robots
6%
Boolean functions
6%
Binary trees
6%
Local search (optimization)
6%
HIgh speed networks
6%
RNA
6%
Embeddings (Algorithms)
6%
Military operations
6%
Wireless networks
6%
Computer hardware
6%
