Mathematics
Facility Location Problem
100%
Asymptotically Optimal
88%
Optimal Algorithm
85%
Travelling salesman problems
48%
Data Reduction
47%
Graph in graph theory
41%
Approximation Algorithms
40%
Profit
39%
Fixed-parameter Algorithms
38%
Communication
31%
Normed Space
30%
NP-complete problem
30%
Matroid Intersection
30%
Chinese Postman Problem
26%
Matroid
25%
Line
22%
Parameterized Algorithms
22%
Transportation Networks
22%
Facility Location
22%
Covering Problem
20%
Costs
20%
Packing Problem
20%
Location Problem
19%
Disorder
19%
Exact Algorithms
19%
Line Graph
19%
Routing
18%
Discrete Distributions
18%
Class
17%
Vertex of a graph
17%
Set Packing
17%
Weight Function
15%
Polynomial-time Algorithm
15%
Euclidean
14%
Tractability
14%
Demand
13%
Polynomial Algorithm
12%
Complement
12%
Path
12%
Polynomial Approximation
12%
Set Covering
11%
Kernelization
11%
Relative Error
11%
Approximate Solution
9%
Family
9%
Generalization
9%
Customers
8%
Hardness
8%
Tend
8%
Treewidth
8%
Engineering & Materials Science
Data reduction
80%
Polynomials
68%
Traveling salesman problem
68%
Approximation algorithms
68%
NP-hard
48%
Polynomial approximation
34%
Profitability
30%
Hamiltonians
20%
Feedback
13%
Costs
12%
Set theory
11%
Distribution functions
8%
Communication
8%
Hardness
6%
Experiments
6%
Stars
5%
