Approximation

Algorithms

Presented by
CRASY BOSE 12500117079
KRITI GUPTA 12500117069
 APPROXIMATION ALGORITHMS
 For a lot of practical applications near-optimal solution are perfectly
acceptable.

Algorithm that return near-optimal solution for a problem are called

approximation algorithms.

What to study polynomial time approximation algorithms for NC-

complete problems.
WHAT IS “ GOOD ENOUGH”

For an approximation algorithm A of input of size n.

The case of solution produced by A is c

Approximation Ratio of A is p(n)

  max ( )
VERTEX COVER PROBLEM
VERTEX COVER
A SUBSET U OF ALL VERTICES V, SUCH THAT EVERY EDGE IN E IS COVERED

Covered Edge

 
an edge e = ( , ) is covered if is chosen .