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.
1. A patient with Chronic Kidney Disease (Stage IV), who makes very little urine, presents to the hospital with severe nutritional deficiencies. You are starting her
Define Macrophages - CSF It is produced by macrophages, fibroblasts and endothelial cells. They specifically stimulate precursors of macrophages. It also enhances effector res
Observing sun spots Use the telescope that you made in a last experiment. Set it up so that it points directly at the sun and focus it so that a clear and bright image of the s
GENERAL FEATURES OF FIRST AID PROCEDURE : The order of priorities in administering first aid is decided by the principal ,objective - to save life. Equally important, you must not
what is an easy way to learn everything about photosynthesis?
What is tocopherols Vitamin E refers to a group of compounds known as which are the derivatives of a parent compound called as 'tocol'. Four tocopherols namely a, P,
Maximum in 50 words for 2marks
Conversion of oxaloacetate to phosphoenolpyruvate Conversion of oxaloacetate to phosphoenolpyruvate: In this reaction, oxaloacetate and guanosine triphosphate (GTP) are
What is necessary to restore the Marshall wetland in Margibi County, Liberia? The Marshall wetland has several features , including mangrove swamp, which is being degraded in some
give the importants segnificant figure in measure quantities
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