Fast and memory-efficient algorithms for evacuation problems

Keyphrases

• Transshipment 100%
• Evacuation Problem 100%
• Memory-based Algorithms 100%
• Submodular Function Maximization 60%
• Evacuation Planning 40%
• Flows over Time 40%
• Transshipment Problem 40%
• Early Arrival 40%
• Novel Algorithm 20%
• Algorithmic Approach 20%
• Supply-demand 20%
• Transit Time 20%
• Oracle 20%
• Source-sink 20%
• Time Problem 20%
• Convex Combination 20%
• Maximum Flow 20%
• Polynomial Space 20%
• Tardos 20%
• Strongly Polynomial Algorithm 20%

Mathematics

• Parametric 100%
• Transshipment Problem 100%
• Polynomial 50%
• Convex Combination 50%
• Desirable Property 50%
• Running Time 50%
• Polynomial Time 50%
• Main Result 50%

Computer Science

• Efficient Algorithm 100%
• Polynomial Time Algorithm 50%
• Algorithmic Approach 50%
• Polynomial Space 50%
• Desirable Property 50%
• Convex Combination 50%