Mathematics
Asymptotically Optimal
100%
Optimal Algorithm
96%
Facility Location Problem
88%
Travelling salesman problems
54%
Data Reduction
53%
Approximation Algorithms
45%
Profit
44%
Fixed-parameter Algorithms
43%
Graph in graph theory
38%
Communication
35%
Normed Space
34%
Matroid Intersection
33%
NP-complete problem
31%
Chinese Postman Problem
30%
Matroid
29%
Line
25%
Parameterized Algorithms
25%
Transportation Networks
25%
Facility Location
25%
Covering Problem
23%
Costs
23%
Packing Problem
22%
Location Problem
22%
Disorder
22%
Exact Algorithms
21%
Line Graph
21%
Routing
21%
Discrete Distributions
21%
Class
20%
Set Packing
19%
Weight Function
17%
Euclidean
15%
Vertex of a graph
15%
Tractability
15%
Polynomial-time Algorithm
14%
Polynomial Algorithm
14%
Complement
14%
Polynomial Approximation
13%
Set Covering
13%
Kernelization
12%
Relative Error
12%
Demand
11%
Approximate Solution
11%
Family
10%
Generalization
10%
Customers
9%
Hardness
9%
Path
9%
Tend
9%
Treewidth
9%
Engineering & Materials Science
Data reduction
90%
Traveling salesman problem
76%
Approximation algorithms
76%
Polynomials
75%
NP-hard
53%
Polynomial approximation
38%
Profitability
34%
Hamiltonians
23%
Feedback
15%
Costs
13%
Set theory
12%
Distribution functions
9%
Communication
9%
Hardness
7%
Experiments
6%
