Please enable JavaScript.
Coggle requires JavaScript to display documents.
NP-Hard Problems - Coggle Diagram
NP-Hard Problems
Traveling Salesman problem
P ≠ NP
̶c̶-̶a̶p̶p̶r̶o̶x̶i̶m̶a̶t̶i̶o̶n̶
f (Sa) ≤ cf (s*)
Greedy Algorithms
Nearest-neighbor algorithm
Multifragment-heuristic algorithm
Euclidean
Triangle Inequality
Symmetry
Minimum-Spanning-Tree-Based Algorithms
Twice-around-the-tree algorithm
2-approximation
Euclidean distances
Christofides Algorithm
Local Search Heuristics
2-opt
2-change
3-opt
Lin-Kernighan
Empirical Results
HeldKarp bound
Knapsack problem
Greedy Algorithms
Discrete Knapsack problem
Enhanced
Greedy algorithm
Continuous Knapsack problem
Approximation Schemes
Fully Polynomial Schemes
Heuristic
̶M̶a̶t̶h̶e̶m̶a̶t̶i̶c̶
Accuracy Ratio
r(Sa)
c-approximation algorithm
r(Sa) ≤ c