Approximation Algorithms

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

Approximation Algorithms
Chapter 35

Basic Concepts
Definitions