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