Download - 2-Approximation Vertex Cover
![Page 1: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/1.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
MotivationalProblem
Approximation Algorithm: The Vertex-coverProblem
Sudipta Saha Shubha 1205014Repon Kumar Roy 1205002
Department of Computer Science and EngineeringBangladesh University of Engineering and Technology
December 24, 2015
![Page 2: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/2.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
MotivationalProblem
Table of Contents
1 Motivational Problem
![Page 3: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/3.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
MotivationalProblem
Motivational Problem : Modeling in Graph
![Page 4: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/4.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
MotivationalProblem
Formal Definition of Vertex Cover Problem
A vertex cover of an undirected graph
G = (V ,E ) is a subset V ′ ∈ V such that
if (u, v) is an edge of G , then either
u ∈ V ′ or v ∈ V ′(or both).
The vertex-cover problem is to find a
vertex cover of minimum size in a given
undirected graph. We call such a vertex
cover an optimal vertex cover.
![Page 5: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/5.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
MotivationalProblem
Formal Definition of Vertex Cover Problem
A vertex cover of an undirected graph
G = (V ,E ) is a subset V ′ ∈ V such that
if (u, v) is an edge of G , then either
u ∈ V ′ or v ∈ V ′(or both).
The vertex-cover problem is to find a
vertex cover of minimum size in a given
undirected graph. We call such a vertex
cover an optimal vertex cover.
![Page 6: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/6.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
MotivationalProblem
Formal Definition of Vertex Cover Problem
A vertex cover of an undirected graph
G = (V ,E ) is a subset V ′ ∈ V such that
if (u, v) is an edge of G , then either
u ∈ V ′ or v ∈ V ′(or both).
The vertex-cover problem is to find a
vertex cover of minimum size in a given
undirected graph. We call such a vertex
cover an optimal vertex cover.
![Page 7: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/7.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
MotivationalProblem
A Solution may be . . .
![Page 8: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/8.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
Way to Solution . . .
Time Complexity is O(2n × n)Time Complexity is exponential oninputNP-complete problem
![Page 9: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/9.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
Way to Solution . . .
Time Complexity is O(2n × n)
Time Complexity is exponential oninputNP-complete problem
![Page 10: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/10.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
Way to Solution . . .
Time Complexity is O(2n × n)Time Complexity is exponential oninput
NP-complete problem
![Page 11: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/11.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Way to Solution . . .
Time Complexity is O(2n × n)Time Complexity is exponential oninputNP-complete problem
![Page 12: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/12.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Way to Solution . . .
A language L ⊆ {0, 1}∗ isNP-complete if1. L ∈ NP , and2. L′ ≤p L for every L′ ∈ NP .
![Page 13: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/13.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Way to Solution . . .
Can be solved using dynamicprogramming in polynomial timewhen input graph is a tree.
![Page 14: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/14.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Way to Solution . . .
Needs approximation algorithm forgeneral graphWe call an algorithm that returnsnear-optimal solutions anapproximation algorithm
![Page 15: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/15.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Way to Solution . . .
Needs approximation algorithm forgeneral graph
We call an algorithm that returnsnear-optimal solutions anapproximation algorithm
![Page 16: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/16.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Way to Solution . . .
Needs approximation algorithm forgeneral graphWe call an algorithm that returnsnear-optimal solutions anapproximation algorithm
![Page 17: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/17.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Table of Contents
2 The Approximate Algorithm
3 Applications
4 Some Questions
![Page 18: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/18.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Simulation
![Page 19: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/19.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Simulation
![Page 20: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/20.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Simulation
![Page 21: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/21.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Simulation
![Page 22: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/22.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Simulation
![Page 23: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/23.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Time Complexity
O(V + E )
![Page 24: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/24.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Proof of 2-Approximation
We say that an algorithm for a problem has anapproximation ratio of ρ(n) if, for any input ofsize n, the cost X of the solution produced bythe algorithm is within a factor of ρ(n) of thecost X ∗ of an optimal solution:
max( XX ∗ ,
X ∗
X )≤ ρ(n).
![Page 25: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/25.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Proof of 2-Approximation(Is it a Vertex-Cover?)
![Page 26: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/26.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Proof of 2-Approximation
We need to prove that |X | ≤ 2|X ∗|We will first prove that |X ∗| ≥ |Y |
![Page 27: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/27.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Proof of 2-Approximation
We need to prove that |X | ≤ 2|X ∗|
We will first prove that |X ∗| ≥ |Y |
![Page 28: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/28.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Proof of 2-Approximation
We need to prove that |X | ≤ 2|X ∗|We will first prove that |X ∗| ≥ |Y |
![Page 29: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/29.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Proof of 2-Approximation(|X ∗| ≥ |Y |)
![Page 30: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/30.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Proof of 2-Approximation(|X ∗| ≥ |Y |) : AnotherSubset of Arbitrary Edges
![Page 31: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/31.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Proof of 2-Approximation(|X ∗| ≥ |Y |) : AnotherSubset of Arbitrary Edges
![Page 32: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/32.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Proof of 2-Approximation(|X ∗| ≥ |Y |) : AnotherSubset of Arbitrary Edges
![Page 33: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/33.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Proof of 2-Approximation(|X ∗| ≥ |Y |) : AnotherSubset of Arbitrary Edges
![Page 34: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/34.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Proof of 2-Approximation
Now we will prove that, |X | = 2|Y |
![Page 35: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/35.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Proof of 2-Approximation(|X | = 2|Y |)
![Page 36: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/36.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Proof of 2-Approximation
|X | = 2|Y ||Y | ≤ |X ∗|So,|X | ≤ 2|X ∗|thereby proving 2-Approximation
![Page 37: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/37.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Table of Contents
2 The Approximate Algorithm
3 Applications
4 Some Questions
![Page 38: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/38.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Applications
Selecting Optimal Position of Security
Cameras.
Setting of ATM booths Optimally.
For Bipartitle Graph, Maximum
Matiching = Minimum Vertex Cover.
![Page 39: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/39.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Applications
Selecting Optimal Position of Security
Cameras.
Setting of ATM booths Optimally.
For Bipartitle Graph, Maximum
Matiching = Minimum Vertex Cover.
![Page 40: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/40.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Applications
Selecting Optimal Position of Security
Cameras.
Setting of ATM booths Optimally.
For Bipartitle Graph, Maximum
Matiching = Minimum Vertex Cover.
![Page 41: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/41.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Applications
Selecting Optimal Position of Security
Cameras.
Setting of ATM booths Optimally.
For Bipartitle Graph, Maximum
Matiching = Minimum Vertex Cover.
![Page 42: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/42.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Table of Contents
2 The Approximate Algorithm
3 Applications
4 Some Questions
![Page 43: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/43.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Some Questions
Is there any graph where this
approximate algorithm always gives
twice the size of optimal solution?
How about repeatedly selecting a
vertex of highest degree, and removing
all of its incident edges?
![Page 44: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/44.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Some Questions
Is there any graph where this
approximate algorithm always gives
twice the size of optimal solution?
How about repeatedly selecting a
vertex of highest degree, and removing
all of its incident edges?
![Page 45: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/45.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Some Questions
Is there any graph where this
approximate algorithm always gives
twice the size of optimal solution?
How about repeatedly selecting a
vertex of highest degree, and removing
all of its incident edges?
![Page 46: 2-Approximation Vertex Cover](https://reader031.vdocuments.site/reader031/viewer/2022021918/58a902841a28ab837c8b6eb7/html5/thumbnails/46.jpg)
ApproximationAlgorithm:
TheVertex-coverProblem
Sudipta SahaShubha1205014
Repon KumarRoy 1205002
TheApproximateAlgorithm
Applications
SomeQuestions
Thanks and Questions are Welcome