Mathematics
Asymptotically Optimal
Optimal Algorithm
Travelling salesman problems
Approximation Algorithms
Data Reduction
Fixed-parameter Algorithms
Facility Location Problem
Normed Space
Profit
Matroid Intersection
Graph in graph theory
Matroid
Chinese Postman Problem
Parameterized Algorithms
Covering Problem
Facility Location
Packing Problem
Discrete Distributions
Location Problem
Set Packing
NP-complete problem
Weight Function
Disorder
Euclidean
Routing
Tractability
Polynomial-time Algorithm
Vertex of a graph
Complement
Polynomial Algorithm
Polynomial Approximation
Kernelization
Set Covering
Costs
Approximate Solution
Relative Error
Line
Polynomial
Tend
Hardness
Independent Set
Computing
Hamiltonian circuit
Class
Cycle Cover
Uniform distribution
Spanning Subgraph
Precedence Constraints
Treewidth
Necessary
Engineering & Materials Science
Traveling salesman problem
Approximation algorithms
Polynomials
Data reduction
Polynomial approximation
Profitability
Hamiltonians
Feedback
Costs
Communication
Distribution functions
Experiments
Hardness
