503_HW6_S11 - G according to the marking heuristic from the...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
UML CS Algorithms 91.503 (section 201) Spring, 2011 Homework #6 Assigned: Tuesday, 4/5 Due: Tuesday, 4/12 at 5:30 p.m. This assignment covers textbook material in Chapter 35 (Approximation Algorithms) and the literature paper: “ On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks” by Wu et al . 1. (60 points) Problem 35-6 on p. 1137 of our textbook, all parts (a)-(e). For part (e), provide pseudocode, correctness justification, and worst-case asymptotic running time. 2 . (40 points) This problem concerns the literature paper: On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks ” by Wu et al . Consider the graph G below: a) Form the connected dominating set for
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: G according to the marking heuristic from the paper by Wu et al . Do not use Rule 1 or Rule 2. Recall that this heuristic has the shortest path property (all vertices along the shortest path between any 2 nodes in the dominating set are also in the dominating set). b) Form a minimal connected dominating set for G that has the shortest path property (that was referred to above in (a)). c) Calculate the approximation ratio for your answer to (a) with respect to your answer in (b). d) Design an example for which the marking heuristic from the Wu et al . paper yields an approximation ratio worse than your answer to (c). G v 1 v 2 v 3 v 4 v 5 v 6 v 7 v 8 v 9 v 10...
View Full Document

This note was uploaded on 02/13/2012 for the course CS 91.503 taught by Professor Staff during the Spring '11 term at UMass Lowell.

Ask a homework question - tutors are online