This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CMPT 405/705 — Design and Analysis of Algorithms Exercises on Flow Networks. Due: Thursday, November 5th (at the beginning of the class) Reminder: the work you submit must be your own. Any collaboration and consulting outside resources must be explicitly mentioned on your submission. 1. Let us consider a very simplified model of a cellular network in a sparsely populated area. We are given the locations of n base stations , specified as points b 1 ,...,b n in the plane. We are given the locations of n cellular phones, specified as points p 1 ,...,p n in the plane. Finally, we are given a range parameter Δ > 0. We call the set of cell phones fully connected if it is possible to assign each phone to a base station in such a way that • Each phone is assigned to a different base station, and • If a phone at p i is assigned to a base station at b j , then the straight-line distance between the points p i and b j is at most Δ. Suppose that the owner of the cell phone at point p 1 decides to go for a drive, traveling continuously for a total z units of distance due east. As this cell phone moves, we may have to update the assignment of phones to base stations (possibly several times) in order to keep the set of phones fully connected....
View Full Document
- Fall '09
- Algorithms, base station, polynomial time algorithm