Scribd
Upload
16 views

Lecture 35 Aproximation Algorithms

This document discusses approximation algorithms for optimization problems that are NP-complete. It provides examples of approximation algorithms for the vertex cover problem and the traveling salesman problem (TSP). For vertex cover, the algorithm adds vertices to the cover when processing each edge until all edges are covered. For TSP, it computes a minimum spanning tree and uses a preorder tree walk to generate a Hamiltonian cycle, taking advantage of the triangle inequality. Approximation algorithms provide efficient solutions that are close to optimal rather than finding exact optimal solutions.

Uploaded by

Ritik chaudhary
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
16 views

Lecture 35 Aproximation Algorithms

This document discusses approximation algorithms for optimization problems that are NP-complete. It provides examples of approximation algorithms for the vertex cover problem and the traveling salesman problem (TSP). For vertex cover, the algorithm adds vertices to the cover when processing each edge until all edges are covered. For TSP, it computes a minimum spanning tree and uses a preorder tree walk to generate a Hamiltonian cycle, taking advantage of the triangle inequality. Approximation algorithms provide efficient solutions that are close to optimal rather than finding exact optimal solutions.

Uploaded by

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

DR.

APJ ABDUL KALAM TECHNICAL UNIVERSITY

Branch - CSE
Design & Analysis of Algorithms

Lecture – 35

Approximation Algorithms
By

Mr. Prabhat Singh


Assistant Professor
Department of Computer Science & Engineering
ABES Engineering College, Ghaziabad
Introduction to Approximation Algorithms:
An Approximate Algorithm is a way of approach NP-COMPLETENESS for the
optimization problem.
This technique does not guarantee the best solution.
The goal of an approximation algorithm is to come as close as possible to the
optimum value in a reasonable amount of time which is at the most polynomial
time.
Such algorithms are called approximation algorithm or heuristic algorithm.
For the traveling salesperson problem, the optimization problem is to find
the shortest cycle, and the approximation problem is to find a short cycle.
For the vertex cover problem, the optimization problem is to find
the vertex cover with fewest vertices, and the approximation
problem is to find the vertex cover with few vertices.
Performance Ratio: Approximation Algorithms
Suppose we work on an optimization problem where every solution carries a cost.
An Approximate Algorithm returns a legal solution, but the cost of that legal
solution may not be optimal.
For Example, suppose we are considering for a minimum size vertex-cover (VC).
An approximate algorithm returns a VC for us, but the size (cost) may not be
minimized.
Another Example is we are considering for a maximum size Independent set (IS).
An approximate Algorithm returns an IS for us, but the size (cost) may not be
maximum.
Let C be the cost of the solution returned by an approximate algorithm, and C* is
the cost of the optimal solution. We say the approximate algorithm has an
approximate ratio P (n) for an input size n, where
Vertex Cover: Approximation Algorithm
Vertex Cover Problem: A Vertex Cover of a graph G is a set of vertices such that
each edge in G is incident to at least one of these vertices.
The decision vertex-cover problem was proven NPC. Now, we want to solve the
optimal version of the vertex cover problem, i.e., we want to find a minimum size
vertex cover of a given graph.
We call such vertex cover an optimal vertex cover C*.
Vertex Cover: Approximation Algorithm
Approx. Vertex-Cover (G = (V, E))
{
C = empty-set;
E'= E;
While E' is not empty do
{
Let (u, v) be any edge in E': (*)
Add u and v to C;
Remove from E' all edges incident to u or v;
}
Return C;
}
Vertex Cover: Approximation Algorithm
The idea is to take an edge (u, v) one by one, put both vertices to C, and remove all
the edges incident to u or v. We carry on until all edges have been removed. C is a
VC. But how good is C?

VC = {b, c, d, e, f, g}
Travelling Salesman: Approximation Algorithm
Travelling Salesman: In the traveling salesman Problem, a salesman must visits n
cities.
We can say that salesman wishes to make a tour or Hamiltonian cycle, visiting each
city exactly once and finishing at the city he starts from.
There is a non-negative cost c (i, j) to travel from the city i to city j.
The goal is to find a tour of minimum cost.
We assume that every two cities are connected.
Such problems are called Traveling-salesman problem (TSP).
We can model the cities as a complete graph of n vertices, where each vertex
represents a city.
It can be shown that TSP is NPC.
If we assume the cost function c satisfies the triangle inequality,
then we can use the following approximate algorithm.
Travelling Salesman: Approximation Algorithm
Triangle inequality:
If we assume the cost function c satisfies the triangle inequality,
then we can use the following approximate algorithm.
Let u, v, w be any three vertices, we have

One important observation to develop an approximate solution is if we remove an


edge from H*, then
Tour becomes a spanning tree.
Travelling Salesman: Approximation Algorithm
Travelling Salesman Approximation Algorithm :

Approx. TSP (G= (V, E))


1. Compute a MST of Graph G;

2. Select any vertex r is the root of the tree;

3. Let L be the list of vertices visited in a preorder tree walk of T;

4. Return the Hamiltonian cycle H that visits the vertices in the order L;
Travelling Salesman: Approximation Algorithm
Travelling Salesman: Approximation Algorithm

Intuitively, Approx TSP first makes a full walk of MST T, which visits each edge exactly two
times. To create a Hamiltonian cycle from the full walk, it bypasses some vertices (which
corresponds to making a shortcut)
THANK YOU

You might also like