Scribd
Upload
22 views

Approximation Algorithm

The document discusses approximation algorithms. Key points: 1) Approximation algorithms generate feasible solutions that are close to optimal, rather than always finding the exact optimal solution, since finding optimal solutions for NP-hard problems may not be possible in reasonable time. 2) There are two types of approximation - algorithms that generate solutions within a constant factor of optimal, and those within a polynomial factor. 3) While absolute approximation algorithms that always find optimal solutions would be best, it is often proven that such algorithms cannot exist for NP-hard problems unless P=NP. So approximation algorithms settle for solutions close to optimal.

Uploaded by

bhadiv612
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
22 views

Approximation Algorithm

The document discusses approximation algorithms. Key points: 1) Approximation algorithms generate feasible solutions that are close to optimal, rather than always finding the exact optimal solution, since finding optimal solutions for NP-hard problems may not be possible in reasonable time. 2) There are two types of approximation - algorithms that generate solutions within a constant factor of optimal, and those within a polynomial factor. 3) While absolute approximation algorithms that always find optimal solutions would be best, it is often proven that such algorithms cannot exist for NP-hard problems unless P=NP. So approximation algorithms settle for solutions close to optimal.

Uploaded by

bhadiv612
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 18

Approximation Algorithm

• Two relaxations of the meaning of "solve.


• First, we remove the requirement that the algorithm that
solves the optimization problem P must always generate an
optimal solution .This requirement is replaced by the
requirement that the algorithm for P must always generate
a feasible solution with value close to the value of an
optimal solution
• A feasible solution with value close to the value of an
optimal solution is called an approximate solution. An
approximation algorithm for P is an algorithm that
generates approximate solutions for P.
• In the case of NP-hard problems, approximate solutions
have added importance as exact solutions(i.e., optimal
solutions)may not be obtainable in a feasible amount of
computing time. An approximate solution may be all one
can get using a reasonable amount of computing time.
• In the second relaxation we look for an
algorithm for P that almost always generates
optimal solutions. Algorithms with this
property are called probabilistically good
algorithms.
• Let A be an algorithm that generates a feasible
solution to every instance of a problem P. Let
F*(I)be the value of an optimal solution to I
and let (I) be the value of the feasible
solution generated by A.
• The most desirable kind of approximation
algorithm is an absolute approximation
algorithm. Unfortunately, for most NP hard
problems it can be shown that fast algorithms
of this type exist only if P =NP. Surprisingly,
this statement is true even for the existence of
f(n)-approximate algorithms for certain NP
hard problems.
• So,we can define approximation problems as k- absolute
approximate problems and f(n)-approximate problems.
• Approximation algorithms are usually just heuristics or
rules that on the surface look like they might solve the
optimization problem exactly.
• However, they do not. Instead, they only guarantee to
generate feasible solutions with values within some
constant or some factor of the optimal value. Being
heuristic in nature, these algorithms are very much
dependent on the individual problem being solved.
ABSOLUTE APPROXIMATIONS
12.2.3 NP-hard AbsoluteApproximations

• The absolute approximation algorithms for the planar graph


coloring and the maximum program storage problems are
very simple and straight forward.
• Thus, one may expect that polynomial time absolute
approximation algorithms exist for most other NP-hard
problems. Unfortunately, for the majority of NP-hard
problem one can provide very simple proofs to show that a
polynomial time absolute approximation algorithm exists if
and only if a polynomial time exact algorithm does.
• The absolute approximate knapsack problem is NP-hard.
12.3 e-APPROXIMATIONS
12.3.2 BinPacking
12.4 POLYNOMIAL TIME APPROXIMATION
SCHEMES

You might also like