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.
Define Universal Donor and Recipients Based on the above mentioned concept, O group individuals are sometimes considered as 'universal donors ', since they have no antigens an
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
Infectious diseases: Some of you may have heard about the great bubonic plague, a fatal disease of the blood, spread by fleas and respiratory secretions. It occurred in epid
difference between micro and macro nutrients
How is the parathyroid hormone secretion regulated? It is simple. An increase in parathyroid hormone causes an increase in calcium absorption from the intestine and renal tubul
If the Quabbin Reservoir Watershed is 100 km2, the average precipitation in New England is 130 cm/year, and the volume of the reservoir is 1.5 x 1012 liters, what is the residence
An experiment with a bottle and cork Tightly close a liitle bottle with a cork or rubber stopper. Place the bottle in the receiver and remove some of the air with the pump.
Define Fats - Nutritional Components Once the body stops eating, it begins to live on its fat. Fat storing depots 'adipocytes' are located in the different parts of the body. I
Question 1. Discuss the biological factors influencing radioactivity. 2. Explain the quality assurance of computed Tomography. 3. Write short notes on the following
how are the earth''s layers formed?
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