#### Question Details

##### [solution] » We dene the Escape Problem as follows. We are given a directed

**Brief item decscription**

Step-by-step solution file

**Item details:**

We dene the Escape Problem as follows. We are given a directed**More:**

**We de?ne the Escape Problem as follows. We are given a directed graph G = ( V,E ) (picture a network of roads). A certain collection of nodes X ? V are designated as populated nodes , and a certain other collection S ? V are designated as safe nodes . (Assume that X and S are disjoint.) In case of an emergency, we want evacuation routes from the populated nodes to the safe nodes. A set of evacuation routes is de?ned as a set of paths in G so that (i) each node in X is the starting point of one path, (ii) the last node on each path lies in S , and (iii) the paths do not share any edges. Such a set of paths gives a way for the occupants of the populated nodes to ?escape? to S , without overly congesting any edge in G . (a) Given G , X , and S , show how to decide in polynomial time whether such a set of evacuation routes exists. (b) Suppose we have exactly the same problem as in (a), but we want to enforce an even stronger version of the ?no congestion? condition (iii): we change (iii) to say ?the paths do not share any nodes .? With this new condition, show how to decide in polynomial time whether such a set of evacuation routes exists. (c) Provide an example with the same G , X , and S , in which the answer is yes to the question in (a) but no to the question in (b)**

** **

**About this question:****STATUS**

Answered

QUALITY

Approved

ANSWER RATING

Pay using PayPal (No PayPal account Required) or your credit card. All your purchases are securely protected by PayPal.

Answered

QUALITY

Approved

ANSWER RATING

This question was answered on: * Feb 21, 2020 *

* * Solution~00066274326.zip (18.37 KB)

This attachment is locked

We have a ready expert answer for this paper which you can use for in-depth understanding, research editing or paraphrasing. You can buy it or order for a fresh, original and plagiarism-free copy (Deadline assured. Flexible pricing. TurnItIn Report provided)

### Need a similar solution fast, written anew from scratch? Place your own custom order

We have top-notch tutors who can help you with your essay at a reasonable cost and then you can simply use that essay as a template to build your own arguments. This we believe is a better way of understanding a problem and makes use of the efficiency of time of the student. New solution orders are original solutions and precise to your writing instruction requirements. Place a New Order using the button below.