Efficient computation of evacuation routes on a three-dimensional geometric network

Keyphrases

• Three-dimensional (3D) 100%
• Efficient Computation 100%
• Evacuation Route 100%
• Geometric Network 100%
• Emergency Evacuation 66%
• Deadline Constraint 33%
• Dynamic Programming Algorithm 33%
• Pseudo-polynomial Time 33%
• Time Dynamics 33%
• Feasible Solution 33%
• NP-hard 33%
• Solution Method 33%
• Random Variables 33%
• Almost Optimal 33%
• Computational Experiment 33%
• Staircase 33%
• Evacuation Time 33%
• Approximation Algorithms 33%
• Polynomial Time 33%
• Fully Polynomial Time Approximation Scheme 33%
• Geometric Structure 33%
• People Movement 33%
• Routing Problem 33%
• Movement Sequence 33%
• Evacuation Network 33%
• Bomb 33%
• Stochastic Routing 33%
• Evacuation Problem 33%
• Rapid Evacuation 33%

Computer Science

• Efficient Computation 100%
• Polynomial Time 100%
• Approximation Algorithms 50%
• Dynamic Programming Algorithm 50%
• Random Variable 50%
• Computational Experiment 50%
• Fully Polynomial-Time Approximation Scheme 50%
• Case Study 50%
• Solution Method 50%
• Routing Problem 50%
• Feasible Solution 50%

Engineering

• Polynomial Time 100%
• Routing Problem 33%
• Random Variable ξ 33%
• Nodes 33%
• Illustrates 33%
• Solution Method 33%
• Actual Occurrence 33%
• Dynamic Programming 33%
• Feasible Solution 33%