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