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.
Solar Wind and Solar Flare Most of the Sun's family is continually bathed in an outflow of material from the Sun's atmosphere. Streams of electrons and protons continuously
Define Pollutants Regulated Under the Clean Water Act? The Federal Water Pollution Control Act (FWPCA) Amendments of 1972 later amended while the Clean Water Act (CWA) organize
State about the Soil Aggregation and Soil Structure In the context of soils the term 'structure' refers to the shape that the soil takes. It may exist as individual particle or
what are the condition necessary for heat transfer to occur?
what are different kinds of natural resource
In Fehling's Test The free sugar group (aldehyde or ketone) reduces the Cu (cupric) ions in an alkaline environment to form Cu 10 (cuprous oxide) and the sugar is itself ox
Night Sky: When you look up at the sky on a clear night, what do you-see? Most of it is dotted with twinkling stars. You may see the moon or Venus as a bright point or Mars as
What is the only usual mineral to be strongly magnetic other than magnetite: Pyrrhotite
is salt separated by filtration
Compare and contrast the characteristics of sound waves and electromagnetic
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: +1-415-670-9521
Phone: +1-415-670-9521
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd