Mathematics
Approximation
56%
Approximation Algorithms
52%
Network Design
37%
Packing
31%
Demand
25%
Rounding
23%
LP Relaxation
23%
Graph in graph theory
23%
Undirected Graph
22%
Integrality
22%
Vertex of a graph
20%
Scheduling
19%
Approximability
18%
Connectivity
18%
Integer Program
18%
Multicommodity Flow
18%
Congestion
17%
Completion Time
16%
Directed Graph
16%
Path
12%
Broadcast
11%
Hypergraph
11%
Steiner network
10%
Greedy Algorithm
10%
Planar graph
9%
Subset
9%
Matroid
9%
Treewidth
9%
Integer
9%
Performance Guarantee
9%
Knapsack Problem
8%
Single Machine
8%
Profit
8%
Weighted Networks
8%
Graph Reduction
8%
Fractional
8%
Covering
8%
Requirements
7%
Engineering & Materials Science
Approximation algorithms
100%
Relaxation
59%
Directed graphs
34%
Polynomials
33%
Scheduling
25%
Costs
14%
Linear programming
12%
Set theory
11%
Bins
10%
Decomposition
9%
Network coding
9%
Throughput
7%
Profitability
6%
Switching networks
6%
Graph algorithms
6%
Labeling
6%
Labels
6%
Topology
5%
Hardness
5%
Restoration
5%
Fiber optic networks
5%
Information retrieval
5%
