Keyphrases
Approximation Algorithms
100%
Bin Packing
54%
Competitive Ratio
52%
Online Algorithms
41%
Bin Packing Problem
39%
Asymptotic Competitive Ratio
32%
Performance Guarantee
30%
NP-hard
27%
Identical Machines
26%
Approximation Ratio
26%
Polynomial-time Approximation Scheme
25%
Polynomial-time Algorithm
24%
Uniform Machines
23%
Covering Problem
22%
Online Bin Packing
22%
Fully Polynomial Time Approximation Scheme
21%
Cardinality Constraint
20%
Bin Covering
20%
Polynomial Time
19%
2-approximation
19%
Synchronous Optical NETwork (SONET)
18%
Migration Factor
18%
Set Covering Problem
17%
Competitive Algorithm
17%
Unweighting
17%
EPTAS
17%
Polynomially Solvable
17%
Perfect Graphs
16%
Bipartite Graph
16%
Approximation Scheme
16%
Add-drop multiplexers
16%
Spanning Tree
16%
Spanning Tree Problem
16%
Makespan
15%
Scheduling Problem
15%
Graph Coloring
15%
Undirected Graph
15%
Load Balancing
14%
Parallel Machines
14%
Makespan Minimization
14%
Weighted Sums
14%
Greedy Algorithm
14%
Preemptive Scheduling
13%
Coloring Problem
13%
Randomized Algorithms
13%
Online Problem
12%
Tight
12%
Minimum Cost
12%
Improved Approximation
12%
Local Search
11%
Mathematics
Polynomial Time
80%
Minimizes
71%
Competitive Ratio
65%
Edge
63%
Packing Problem
51%
Asymptotics
48%
Tree Problem
26%
Spanning Tree
23%
Integer
22%
Cardinality
20%
Total Number
20%
Polynomial
19%
Bipartite Graph
17%
Weighted Sum
16%
Covering Problem
15%
Upper Bound
15%
Cost Function
14%
Graph Coloring
14%
Stochastics
13%
Local Search
13%
Fully Polynomial-Time Approximation Scheme
13%
Min-Max
13%
Independent Set
13%
Single Machine
12%
Greedy Algorithm
12%
Asymptotic Approximation
11%
Matrix (Mathematics)
11%
Objective Function
11%
Robust Algorithm
11%
Approximates
11%
Feasible Solution
11%
Parametric
10%
Total Cost
10%
Routing and Wavelength Assignment
10%
Supremum
10%
Minimum Spanning Tree
9%
Free Graph
8%
Interval Graph
8%
Vehicle Routing Problem
7%
Unit Interval
7%
Constant Value
7%
Rounding
7%
Main Result
7%
Minimization Problem
6%
Budget Constraint
6%
Running Time
6%
Performance Measure
6%
Constant Factor
6%
Approximate Solution
6%
Cost Allocation
5%
Computer Science
Approximation Algorithms
85%
Competitive Ratio
59%
Polynomial Time
54%
Approximation (Algorithm)
33%
on-line algorithm
32%
Time Approximation Scheme
32%
Bin Packing Problem
31%
Cardinality
28%
Performance Guarantee
25%
Polynomial Time Algorithm
21%
Approximation Ratio
20%
Scheduling Problem
18%
Preemptive Scheduling
17%
approximation scheme
17%
Feasible Solution
16%
Spanning Tree
16%
Add-Drop-Multiplexer
16%
Directed Graphs
15%
Objective Function
14%
Parallel Machine
14%
Bipartite Graph
14%
Fully Polynomial-Time Approximation Scheme
13%
Optimization Problem
12%
Completion Time
12%
Processing Time
12%
Stream Traffic
12%
Greedy Algorithm
11%
Telephony System
10%
wireless link
10%
Cellular System
10%
Search Technique
10%
Packing Problem
9%
Randomized Algorithm
9%
Search Strategies
8%
Vehicle Routing
8%
Load Balancing
8%
Integer Program
8%
Load Balancing Problem
7%
Subgraphs
7%
Unified Framework
7%
Maximum Weight Matching
7%
Minimum Spanning Tree
6%
Single Machine
6%
Optimal Algorithm
6%
Batch Scheduling
6%
Arbitrary Number
6%
Graph Coloring
6%
Cost Allocation
6%
Traveling Salesman Problem
6%
Network Design
5%
