Upload
rajiv-omar
View
62
Download
0
Embed Size (px)
Citation preview
Randomized AlgorithmsCS648
Lecture 17
Miscellaneous applications of Backward analysis
1
MINIMUM SPANNING TREE
2
Minimum spanning tree
3
b
ac
d
h x
y
u
v
18
7
1
19
22
10
312
3
15
11
5
16
17
13
4 2
9
6
Minimum spanning tree
Algorithms:
• Prim’s algorithm
• Kruskal’s algorithm
• Boruvka’s algorithm
4
b
ac
d
h x
y
u
v
18
7
1
19
22
10
312
3
15
11
5
16
17
13
4 2
9
6
Less known but it is the first algorithm for MST
Minimum spanning tree
5
Minimum spanning tree
6
Minimum spanning tree
7
Minimum spanning tree
8
Light Edge
9
b
ac
d
h x
y
u
v
18
7
1
19
22
10
312
3
15
11
5
16
17
13
4 2
9
6 31
USING BACKWARD ANALYSIS FORMISCELLANEOUS APPLICATIONS
10
PROBLEM 1SMALLEST ENCLOSING CIRCLE
11
Smallest Enclosing Circle
12
Smallest Enclosing Circle
13
PROBLEM 2SMALLEST LENGTH INTERVAL
14
0 1
Sampling points from a unit interval
PROBLEM 3MINIMUM SPANNING TREE
16
Light Edge
17
b
ac
d
h x
y
u
v
18
7
1
19
22
10
312
3
15
11
5
16
17
13
4 2
9
6 31
USING BACKWARD ANALYSIS FORTHE 3 PROBLEMS :
A GENERAL FRAMEWORK
18
A General framework
19
PROBLEM 3MINIMUM SPANNING TREE
20
A BETTER UNDERSTANDING OF LIGHT EDGES
21
Minimum spanning tree
22
b
ac
d
h x
y
u
v
18
7
1
19
22
10
342
3
15
11
5
16
17
13
4 2
19
6
x
b
ac
d
h
y
u
v
181
19
22
10 15
11
5
16
4
31
31
Random sampling
Minimum spanning tree
23
b
ac
d
h x
y
u
v
18
7
1
19
22
10
342
3
15
11
5
16
17
13
4 2
19
6
x
b
ac
d
h
y
u
v
1
19
10 15
11
5
16
4
31
18
22
31
Minimum spanning tree
24
b
ac
d
h x
y
u
v
18
7
1
19
22
10
342
3
15
11
5
16
17
23
4 2
19
6
b
ac
d
h x
y
u
v
1
19
10 15
11
5
16
4
7
342
3
17
23
2
19
6
31
Minimum spanning tree
25
b
ac
d
h x
y
u
v
18
7
1
19
22
10
342
3
15
11
5
16
17
23
4 2
19
6
b
ac
d
h x
y
u
v
7
1
19
10
342
3
15
11
5
16
17
23
4 2
19
6
31
Light
First useful insight
26
Minimum spanning tree
27
b
ac
d
h x
y
u
v
18
7
1
19
22
10
342
3
15
11
5
16
17
23
4 2
19
6
b
ac
d
h x
y
u
v
7
1
19
10
342
3
15
11
5
16
17
23
4 2
19
6
31
Light heavy
Minimum spanning tree
28
b
ac
d
h x
y
u
v
7
1
3 3
54 2
6
b
ac
d
h x
y
u
v
7
1
19
10
3 3
15
11
5
16
17
4 2
42
23
19
6
Light heavy
Second useful insight
29
Light Edge
30
b
ac
d
h x
y
u
v
18
7
1
19
22
10
312
3
15
11
5
16
17
13
4 2
9
6 31
We shall answer the above question using the Generic framework. But before that, we need to get a better understanding of the
corresponding random variable.
31
32Light
33Light heavy
34
Step 1
35
Step 2
36
Step 2
37Light heavy
Step 2
38
Step 3
Expressing the entire experiment as Randomized Incremental Construction
A slight difficulty in this process is the following:
• The underlying experiment talks about random sample from a set.
• But RIC involves analyzing a random permutation of a set of elements.
Question: What is relation between random sample from a set and a random permutation of the set ?
Spend some time on this question before proceeding further.
39
random sample and random permutation
40
Step 3
41
Step 3
42
…
Step 3
43
…
Step 3
44
…
45
Forward analysis
…
46
Backward analysis
…
47
Backward analysis
…
Use Lemma 2.
48
Backward analysis
…
49
50