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.
Explain the Duodenum The first part of the small intestine is called the diodenum. It is about 10 inches in length. At the mid-point of the duodenum, there is a common opening
Describe the formation of igneous and metamorphic rocks? Ans) Igneous rocks are formed by volcanic action and due to of volcanic activity. Metamorphic rock is formed by a co
Explain what Diffusion is? Diffusion, we learnt is a simple process of movement of individual molecules from one region to another. Figure illustrates passive transport where m
A Cloud Made of Comets The cold outer areas beyond Pluto are the regions of comets, those visitors that dash, around the Sun, seldom to be seen again. Comets are of grei3t
The Water Cycle Heat some water unless it is near the boiling point. Place it in a drinking glass and rotate the glass so as to moisten the sides right to the top. Place some v
The buoyancy of water Find a metal can like a coffee can or a cigarette tin which has a tightly fitting cover. With the cover on, push the can into a pail of water, cover end d
The Sun is the most important star from our point of view. It is the only star close enough to be studied in considerable detail. The grandeur of the Sun is partly because of
Optics: The prevalence of eye diseases in the desert and tropical countries led to the study of the eye by Arab doctors. Surgical treatment of the eye led to renewed interest
about juxta glomerular appartus
Explain Idiopathic Thrombocytopenic Purpura "Thrombocytopenic" means the blood doesn't comprise adequate platelets. "Purpura" means a person has excessive bruising. You may als
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