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.
which state of matter does light travel the fastest through
Mr. X is probably well adjusted (Mt=42). Neither he nor others see him as anxious (Pt=59), and he either denies or does not experience depressiveness (DEP=41). He does not wake up
Explain Acclimatization - Histotoxic Hypoxia A compensatory respiratory adjustment at moderately high altitudes is called acclimatization. If you were to visit places like Leh
Storage of Chemicals : You have read about the stores as important structures of all the labs in previously. Storage of chemicals whether in small amount or in bulk is another imp
Soil particle distribution The grouping of soil particle distribution into different groups has been done, though arbitrarily, each group represents a range. The limit does no
1. What is the Solar Neutrino problem, and what are the possible resolutions of it? Which of these resolutions is now believed to be the most likely explanation? 2.What is the m
what is ment by general organization in phylum annelida
Human factor engineering: With the advances in science and technology, we have to constantly interact with machines and engineering systems. The range is wide, whether it is
about solar system how does it works
Earth How do we describe the 'big ball' on which we live? Seen from space, it appears as a bluish-white sphere. Its wealth of plant and animal life, snow covered peaks, blue oc
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