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.
Enzymes of intestinal juice Aminopepetidase is an exopeptidase and cleaves peptide bonds next to N-terminal amino acids of polypeptides and oligopeptides (unlike carboxypept
how a student nurse can apply the knowledge of mental health and mental hygiene in her personal and professional life
How is energy from food and energy from gasoline different?
nature and scope
Describe the history of rock cycle? We will follow the full rock history, or "life-cycle", of a piece of granite in the Sierra Nevada mountains of California. The life cycle of
Flammable Solids : Flammable solids are substances which are flammable or liable to spontaneous combustion or emit flammable gases on contact with water. Examples are: camphor, ci
State of Communication in the Past: Those of us who have experience of life in remote villages, far away from urban centres, are familiar with such features as poor roads whi
Use the following procedure for fire fighting. (1) Always take a position between the fire and the exit so your escape route cannot be cut off. Fire extinguishers should always
Procedure : Unscrew the plug top with the help of a screw driver. Remove one of the screws on the wire clamp and loosen the other. Cut away about 50 mm of the outer sheath of the
Mr. X was administered the Personality Assessment System (PAS), which is an individually-administered assessment of a person's personality structure and function. His total P score
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