Download presentation

Presentation is loading. Please wait.

Published byKhalid Bowlsby Modified over 2 years ago

1
Randomized Algorithms Randomized Algorithms CS648 1

2
Overview 2 To design efficient algorithm A new tool to design an efficient algorithm

3
RECAP OF THE PREVIOUS LECTURE 3

4
Graph and Multi-graph A multi-graph may have: More than one edge between a pair of vertices No self loop 4

5
Min-Cut 5

6
SOME BASIC FACTS 6

7
Min-Cut 7 How about cuts in multi-graph ?

8
8

9
9

10
10

11
11

12
12

13
Algorithm for min-cut 13

14
Algorithm for min-cut 14

15
Algorithm for min-cut 15

16
REVISITING RECURRENCES In the following slides, we shall revisit common recurrences. Try to solve these recurrences in a simple manner instead of using Masters theorem. This will help you develop a useful insight into recurrences. This insight will help you fine-tune the previous inefficient algorithm and eventually lead to design (and analysis) of a more efficient algorithm for min-cut. 16

17
Common recurrences 17

18
Common recurrences 18

19
FASTER MIN-CUT ALGORITHM 19

20
Revisiting algorithm for min-cut 20 We shall modify this algorithm to improve its success probability. But we shall not allow any significant blow up in the running time.

21
Algorithm for min-cut 21

22
Key observations about Min-Cut algorithm 22 recursively

23
Revised algorithm for min-cut 23

24
Faster algorithm for min-cut 24

25
25

26
Solving the recurrence 26

27
Solving the recurrence 27

28
Solving the recurrence 28

29
Solving the recurrence 29 proof

30
This lecture introduced many concepts which can be used for design and analysis of efficient randomized algorithms. Try to reflect upon these concept… 30

Similar presentations

© 2016 SlidePlayer.com Inc.

All rights reserved.

Ads by Google