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.
how do some flower make there own food
Properties of a Beating Heart Heart Let us study a few interesting properties of a beating heart which make it such a unique organ. 1. Automaticity 2. Rhythmicity 3. L
Explain Passive transport or diffusion - Mechanism of Urine Formation Passive transport or diffusion: Diffusion means the random movement of particles in a fluid. The movement
What time period can carbon-14 dates have? Carbon 14 has a half-life of 5,730 years, and thus it can be used to date very precisely a large majority of things, particularly woo
State the Pipette Method of soil The sieve analysis, though is a true particle size analysis, is unable to separate particles smaller than 20 microns. Such particles are sep
what is the best part of the body??
ehat is protoplasm and other levels of organization
Define Creatinine in Urine Creatinine: It is an end-product of protein metabolism, an anhydride of creatine, found in the blood and urine that can be used to help assess if the
QUESTION 1 (a) Define aquaculture (b) What is the importance of aquaculture? (c) Name 4 aquaculture species cultured in Mauritius. (d) List down the criteria for selec
Discuss about the life on earth We can say that all life on Earth is locked in the minerals and by weathering nutrients important to life are made available. Even life in the s
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