Scribd
Upload
9 views98 pages

Chapter19 Randomized

Uploaded by

MAHALAKSHMI GANESH
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views98 pages

Chapter19 Randomized

Uploaded by

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

Chapter 19: Randomized

and Approximation
algorithms
D R . S . SR IDH A R

A S S O C I A TE P R O F ES S O R

DEP ARTM ENT O F I S T

AN N A U N I V E RS IT Y
objectives
What is a randomized algorithm?
Advantages of randomized algorithms
Disadvantages of randomized algorithms
Differences
Principles of randomized algorithms
Principles
Principles
Need for Good random number
generator
Properties of good random number
generator
Properties
Random number generator
Categorization of Algorithms
Example
Solution
Informal algorithm
Formal algorithm
Types of randomized algorithm
Hiring Problem
Informal algorithm
Formal algorithm
Informal algorithm
Formal algorithm
Complexity analysis
Complexity analysis
Fermat algorithm
Formal algorithm
Complexity analysis
Randomized string comparison
Informal algorithm
Sender formal algorithm
Receiver formal algorithm
Complexity analysis
Randomized quicksort
Formal algorithm
Complexity analysis
Contd..
Final complexity analysis
Approximate algorithms
Goodness Factor
Goodness Factor
Advantages
Disadvantages
Classification of approximate algorithms
Contd..
More Types
Approximation Schemes
Classification of Approximation problems
Design Principles
Difference between Heuristics and
approximation algorithms
Nearest neighbor heuristic
Example
Solution
Formal algorithm
Multi-fragment Heuristic method
Formal algorithm
Complexity analysis
Twice-the-path-Heuristic
Informal algorithm
Formal algorithm
Complexity analysis
Example
Solution
Christofides algorithm
Stages
Formal algorithm
Complexity analysis
Greedy knapsack approximation
algorithm
Formal algorithm
Complexity analysis
Vertex cover problem
Informal algorithm
Formal algorithm
Better approximation algorithm
Formal algorithm
Complexity analysis
Set Cover Problem
Example – How to Select Technicians
Informal algorithm
Formal algorithm
Complexity analysis
Approximation using Linear Programming
Vertex cover problem
Informal algorithm
Complexity analysis
Dynamic Programming
Informal algorithm
Formal algorithm
Complexity analysis
Subset Sum Problem – (Old Sum of
Subsets) – Exact Solution
Formal algorithm - Exact
Formal algorithm
Complexity Analysis
Glossary
Glossary

You might also like