Explore tens of thousands of sets crafted by our community.
Approximation Algorithms
4
Flashcards
0/4
Christofides Algorithm
An approximation algorithm used for solving the Traveling Salesman Problem in weighted graphs. It guarantees to return a tour at most 1.5 times the optimal length for graphs satisfying the triangle inequality.
Simulated Annealing
A probabilistic technique used to approximate the global optimum of a given function. It's used in large search spaces and for problems like circuit design and protein folding.
Local Search Algorithm
A heuristic method for solving computationally hard optimization problems. Local search algorithms move from solution to solution in the space of candidate solutions by applying local changes, until a solution deemed optimal is found or a time bound is exceeded.
Greedy Algorithm
A Greedy algorithm makes the locally optimal choice at each stage with the hope of finding a global optimum. It's used in scenarios like the Knapsack problem, graph colorings, and job scheduling.
© Hypatia.Tech. 2024 All rights reserved.
