Outline ynamIc FloW Networks Congestion in Dynamic Flows Evacuation flows Problem definitions Known results EXample algorithm 1: k-Sink Evacuation on a Path Example algorithm 2: 1-sink Min-Max Regret Evacuation on a Path with uniform capacity Open problemsOutline • Dynamic Flow Networks • Congestion in Dynamic Flows • Evacuation Flows • Problem Definitions • Known Results • Example Algorithm 1: k-Sink Evacuation on a Path • Example Algorithm 2: 1-sink Min-Max Regret Evacuation on a Path with uniform capacity • Open Problems 3