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