Computer Science
Approximation (Algorithm)
100%
Approximation Algorithms
76%
Directed Graphs
56%
Network Design Problem
29%
Network Design
26%
Approximation Ratio
25%
Constant Factor
24%
Linear Programming
21%
Planar Graph
17%
Polynomial Time
17%
Integer Program
16%
Completion Time
15%
Routing Problem
15%
Subgraphs
14%
Logarithmic Approximation
14%
Cardinality
13%
Optimization Problem
11%
Time Approximation Scheme
10%
Knapsack
10%
Spanning Tree
10%
Optical Network
10%
Randomized Algorithm
9%
on-line algorithm
9%
Contention Resolution
9%
approximation scheme
8%
Scheduling Problem
8%
Single Machine
8%
Greedy Algorithm
8%
Processing Time
8%
steiner tree
8%
weighted graph
8%
Resolution Scheme
8%
Vertex Connectivity
7%
Fast Algorithm
7%
Knapsack Problem
7%
Directed Path
7%
Steiner Tree Problem
7%
Multiplicative Weight
6%
Packing Problem
6%
multi-processor
6%
Network Coding
6%
Precedence Constraint
6%
Primal-Dual
6%
Capacity Constraint
5%
Rounding Algorithm
5%
Connectivity Problem
5%
Metric Space
5%
Parallel Machine
5%
Fault Tolerant
5%
Weighted Average
5%
Keyphrases
Approximation Algorithms
71%
Approximation Ratio
33%
Undirected Graph
30%
Integrality Gap
27%
Directed Graph
24%
2-approximation
22%
LP Relaxation
21%
Congestion
19%
Multicommodity Flow
18%
Hypergraph
17%
Capacitated
17%
Constant-factor Approximation Algorithm
17%
Greedy Algorithm
16%
Matroid
15%
Cutting Problem
14%
Edge-disjoint Paths
14%
Submodular Function Maximization
14%
Weighted Completion Time
14%
Planar Graph
13%
Survivable Network Design Problem
13%
Network Design Problem
12%
Logarithmic Approximation
12%
K-cut
12%
Treewidth
12%
All-or-nothing
12%
Linear Programming Relaxation
12%
Packing Integer Programs
12%
Fast Algorithm
12%
Element Connectivity
11%
Buy-at-bulk Network Design
10%
Extended Abstracts
10%
Polynomial Time
10%
Flow-cut Gap
10%
Contention Resolution Schemes
10%
Multi-commodity Flow Problem
10%
Network Design
9%
Submodular Function
9%
Steiner Problem
9%
Polynomial-time Algorithm
9%
Monotone Submodular Functions
9%
Multi-commodity
9%
Unsplittable Flow Problem
8%
Multilinear Relaxation
8%
Packing Problem
8%
Randomized Algorithms
8%
NP-hard
8%
Edge Disjoint Path Problem
8%
Approximation Scheme
8%
Edge-connectivity
8%
Precedence Constraints
7%
Mathematics
Edge
87%
Integer
37%
Minimizes
35%
Rounding
32%
Polynomial Time
31%
Approximates
24%
Constant Factor
24%
Hypergraphs
22%
Cardinality
19%
Greedy Algorithm
19%
Running Time
19%
Minimum Cutting
18%
Planar Graph
18%
Upper Bound
16%
Nonuniform
15%
Main Result
15%
Approximability
14%
Single Machine
14%
Set Function
13%
Worst Case
12%
Linear Programming Relaxation
11%
Fast Algorithm
11%
Edge-Connectivity
11%
Linear Time
11%
weighted graph
10%
Resolution Scheme
9%
Metric Space
9%
Weighted Undirected Graph
9%
Spanning Tree
9%
Combinatorial Algorithm
9%
Tree Problem
9%
Polytope
9%
Polynomial
9%
Path Problem
9%
Generalized Assignment Problem
8%
Linear Programming
7%
Open Problem
7%
Weighted Average
7%
Probability Distribution
7%
Randomized Rounding
7%
Orienteering Problem
6%
Network Weight
6%
Minor Theorem
6%
Unit Time
6%
Time Window
6%
Triangle Inequality
5%
Linear Program
5%
Min-Cut
5%