Scribd
Upload
3 views3 pages

Approximation Algorithms

Uploaded by

mahbub.rhmn.m
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
3 views3 pages

Approximation Algorithms

Uploaded by

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

a.

Write a short hand note within 5 leaves (10 pages) on all the
topics of the Midterm that I have given as lectures.
b. Write a short report on your topic within 2 leaves (4 pages) that
you will have to discuss after the midterm examination.
c. Write a framework of your paper within 3 leaves (6 pages) that
you will have to submit on of before the final term examination of
this semester.

Approximation Algorithms

An Approximation Algorithm for Sorting by Reversals and


Transpositions

What is the Approximation algorithm?


Approximation algorithms are designed to solve problems not solvable in
polynomial time for approximate solutions. These problems are known as
NP-complete problems. These problems are significantly effective in
solving real-world problems, therefore, it becomes important to solve them
using a different approach.

NP-complete problems can still be solved in three cases:

1. the input could be so small that the execution time is reduced


2. some problems can still be classified into problems that can be solved
in polynomial time
3. use approximation algorithms to find near-optima solutions for
the problems.

Performance Ratios
The main idea behind calculating the performance ratio of an
approximation algorithm also called an approximation ratio, is to find how
close the approximate solution is to the optimal solution.

The approximate ratio is represented using ρ(n) where n is the input size of
the algorithm, C is the near-optimal solution obtained by the algorithm, and
C* is the optimal solution for the problem. The algorithm has an approximate
ratio of ρ(n) if and only if −
max{C/C∗,C∗/C}≤ρ(n)
The algorithm is then called a ρ(n)-approximation algorithm.

Example:

Advantages:

Disadvantages:
Genome rearrangements:

Genome rearrangements are mutations that change the gene content of a


genome or the arrangement of the genes on a genome.

combinatorial problem:

A combinatorial problem consists in, given a finite collection of objects and a set
of constraints, finding an object of the collection that satisfies all constraints (and
possibly that optimizes some objective function).

Reversal, which inverts the order and the orientation of the genes inside
a segment of the genome.

Transposition, that moves a segment of the genome to another position.

(4 – 2/k)-approximation algorithm for sorting by reversals and


transpositions.
Proving an upper bound means you have proven that the algorithm will
use no more than some limit on a resource.
Proving a lower bound means you have proven that the algorithm will use no
less than some limit on a resource.
"Resource" in this context could be time, memory, bandwidth, or something
else.

You might also like