WINSEM2015-16_CP1258_02-MAY-2016_RM01_approximation_cormen.pdf - Approximation Algorithms How to Treat NP-Complete Problems Approximation Algorithms

WINSEM2015-16_CP1258_02-MAY-2016_RM01_approximation_cormen.pdf

This preview shows page 1 - 11 out of 24 pages.

Approximation Algorithms
Image of page 1
How to Treat NP-Complete Problems?? Approximation Algorithms Heuristic Upper or Lower Bounds Greedy, Simulated Annealing, Genetic “Alg”, AI Mathematical Programming Linear Programming for part of problem Integer Programming Quadratic Programming... Search Space Exploration: Gradient Descent, Local Search, Pruning, Subdivision Randomization, Derandomization Leverage/Impose Problem Structure Leverage Similar Problems
Image of page 2
Approximation Algorithms Chapter 35
Image of page 3
Basic Concepts Definitions
Image of page 4