Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
You are the mayor of a beautiful city by the ocean, and your city is connected to the mainland by a set of k bridges. Your city manager tells you that it is necessary to come up with an evacuation plan in the event of a hurricane. Your idea is to add a sign at each intersection pointing the direction of the route to the closest of the k bridges. You realize that this can be modeled as a graph problem, where the street intersections are nodes, the roads are edges, and the edge weights give the driving time between two adjacent intersections. Note that some of the roads in your city are one-way roads.
(a) Explain how to solve the evacuation-route problem in O(mlog n) time, where n is the number of intersections and m is the number of streets connecting two adjacent intersections. Note that the number of bridges k is not a constant, that is, it may depend on n and m. Therefore, a running time of O(k · mlog n) is not an acceptable solution. (Although I will give half credit for such a solution.) The output of your algorithm will be a labeling of the intersections, with an arrow pointing to the road to take to the closest bridge.
(b) Some of the bridges can hold more capacity than others. For 1 ≤ i ≤ k, we associate a positive numeric weight ci with each bridge. To encourage people to use bridges with higher capacity, we treat distances to different bridges differently. In particular, if δ is the actual distance from some intersection to bridge i, we assign it a capacity-weighted distance of δ/ci. Therefore, the higher the bridge capacity is, the lower the weighted distance. Present an O(mlog n) time algorithm to solve the evacuation-route problem using capacity-weighted distances. (Again, I will give half credit for a solution running in O(k · mlog n) time. Problem 4 additional info: 2b - some of the bridges will be higher capacity. Their weights will be function of (distance/number of lanes) → this will give us shorter weight and we can treat it as a better route to take even though the distance is farther away.
Ecosystem: As far as we know, our earth is the only planet where life exists, though scientists su constantly searching for signs of life on other heavenly bodies. You have al
PROCEDURE A. For Gas Supply Visit the LPG gas store room 1 cracking plant along with your counsellor or the lab in charge' and note the way supply of gas is regulated. It
Mr. X's medical history is fairly uncomplicated [...]. Family medical history is significant for [...]. Mr. X's verbal responses were very articulate, and he gave long, express
Explain the Medulla Oblongata The medulla extends from the pons above and is continuous with the spinal cord below as can be seen in Figure. It is about 2.5 cm long shaped like
1. city destroyed by earthquake in 1923? 2.the place where two plates collide and one goes over top the other? 3.sudden stress changes in the earth that cause ground shaking.They o
Moisture comes from home plants Place a cellophane bag over a leaf of some house plant or garden plant and close the end about the stem with a rubber band. Make an observation
describe the differences between GDP and GDP per capita
Ecological Crises in Oceans and Coasts: Coastal and marine areas all over the world including those in India are under stress, because two thirds of the world's population li
What is Transamination Reaction ? Most common amino acids can be converted into the corresponding keto acid by 'transamination. In this reaction, there is a transfer of a-amin
identify ten diagnostic medical terms that use suffixes note note suffixes and provide definitions
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd