Scribd
Upload
48 views6 pages

Approximation Algorithms: Presented by

The document discusses approximation algorithms. Approximation algorithms provide near-optimal solutions for problems in polynomial time, when finding optimal solutions may not be possible. Specifically, it discusses studying polynomial time approximation algorithms for problems that are non-deterministic polynomial-time (NP)-complete. As an example, it defines the vertex cover problem as finding a subset of vertices in a graph such that every edge is covered by at least one endpoint vertex. Approximation algorithms provide solutions that are within a certain factor of optimal.

Uploaded by

Crasy Bose
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
48 views6 pages

Approximation Algorithms: Presented by

The document discusses approximation algorithms. Approximation algorithms provide near-optimal solutions for problems in polynomial time, when finding optimal solutions may not be possible. Specifically, it discusses studying polynomial time approximation algorithms for problems that are non-deterministic polynomial-time (NP)-complete. As an example, it defines the vertex cover problem as finding a subset of vertices in a graph such that every edge is covered by at least one endpoint vertex. Approximation algorithms provide solutions that are within a certain factor of optimal.

Uploaded by

Crasy Bose
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 6

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 .

You might also like