Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Because the algorithm chooses C and P1 and then ignores P2N-1, for the Eperim doesn't the algorithm select every other vertex? I'm confused regarding how

image text in transcribed

Because the algorithm chooses C and P1 and then ignores P2N-1, for the Eperim doesn't the algorithm select every other vertex? I'm confused regarding how to determine the cover and approximation ratio given that Espoke will have only C and p1 as a cover because it vertex C covers all other edges.

Consider the wheel graph Wn which has vertex set V={c,p1,p2,,p2n1,p2n}, and edge set E=EperimEspoke where Eperim={(p1,p2),(p2,p3),,(p2n1,p2n),(p2n,p1)} and Espoke={(c,p1),(c,p3),,(c,p2n1)}. (a) For the Vertex Cover approximation algorithm presented in lecture, determine the resulting cover and approximation ratio when the algorithm is applied to Wn and the edges are presented to the algorithm as (c,p1),(c,p3),,(c,p2n1),(p1,p2),(p2,p3),,(p2n1,p2n). Explain vour reasoning

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database Security

Authors: Alfred Basta, Melissa Zgola

1st Edition

1435453905, 978-1435453906

More Books

Students also viewed these Databases questions