I need help with Computational Theory assignment

A new wireless company, OttoMobile, would like to set up cellular service in the city of Ann Arbor. The company would like to maximize the number of cell towers in the city. However, the city has just passed a rule that a company cannot place cell towers in adjacent neighborhoods. Suppose that there are nneighborhoods and that each neighborhood is adjacent to at most 6 other neighborhoods. The company uses the following randomized algorithm to determine where to place cell towers, where H is the set of neighborhoods and M is the set of pairs of adjacent neighborhoods:

A = -On input

1. Let P = Pi pn be a permutation of H chosen uniformly at random.

2. Let C = 0.

3. For i = 1 to n:

4. If none of pis adjacent neighborhoods have been encountered yet (i.e. none are in the set {pi,... add pi to O.

5. Return C.-

A. Suppose that neighborhood hi has exactly 6 adjacent neighborhoods. Compute the probability that the algorithm assigns ht to the set C.

B. Now suppose that h, has 6 adjacent neighborhoods. What is a nontrivial lower bound on the probability that the algorithm assigns /i, to the set C? Justify your answer.

C. Assuming that each hi has 6 adjacent neighborhoods, compute a nontrivial lower bound on the expected size Ex[j(7|].

D. What is the approximation ratio a the algorithm achieves in expectation? Justify your answer.

A new wireless company, OttoMobile, would like to set up cellular service in the city of Ann Arbor. The company would like to maximize the number of cell towers in the city. However, the city has just passed a rule that a company cannot place cell towers in adjacent neighborhoods. Suppose that there are nneighborhoods and that each neighborhood is adjacent to at most 6 other neighborhoods. The company uses the following randomized algorithm to determine where to place cell towers, where H is the set of neighborhoods and M is the set of pairs of adjacent neighborhoods:

A = -On input

1. Let P = Pi pn be a permutation of H chosen uniformly at random.

2. Let C = 0.

3. For i = 1 to n:

4. If none of pis adjacent neighborhoods have been encountered yet (i.e. none are in the set {pi,... add pi to O.

5. Return C.-

A. Suppose that neighborhood hi has exactly 6 adjacent neighborhoods. Compute the probability that the algorithm assigns ht to the set C.

B. Now suppose that h, has 6 adjacent neighborhoods. What is a nontrivial lower bound on the probability that the algorithm assigns /i, to the set C? Justify your answer.

C. Assuming that each hi has 6 adjacent neighborhoods, compute a nontrivial lower bound on the expected size Ex[j(7|].

D. What is the approximation ratio a the algorithm achieves in expectation? Justify your answer.

ASSESSMENT BRIEFSubject Code and Name ACCT6001 Accounting Information SystemsAssessment Assessment 4 – Database Application - Case StudyIndividual/Group IndividualLearning Outcomes (b) Explain the characteristics...Hello,I have done some of my assessments but am not sure about the rest, if you have time to have a look at it.ThanksProject DetailsLearning OutcomesStudents are required to:1. Work in a team and engage in negotiation of goals and methods. (PTS4)2. Solve a software development related problem while choosing the right...Suppose 𝑦 = 𝛽0 + 𝛽1𝑥1 + 𝛽2𝑥2 + 𝜖 is linear regressionmodel of weekly food expenditure (y) on weeklyhousehold income (x1) and household size (x2)....I want to submit an interim report basis my research proposal topic submission and acceptance. Research proposal topic submission file and guideline documents received from the university are attached...RESEARCH PROJECTASSESSMENT 2 ASSESSMENT OVERVIEWKey Assessment Information PURPOSEExamine the significance of integrated reporting within the context of different financial and nonfinancial disclosure...Question:In the motivation letter, articulate clearly your reasons for applying. Consider your activities, experiences and commitment related to the field of the programme. Relate your plans after graduation,...**Show All Questions**