Polynomial time algorithms for some evacuation problems
Year: 1994
Type: report
Abstract: Evacuation problems can be modeled as flow problems on dynamic networks. A dynamic network is defined by a graph with capacities and integral transit times on its edges. The maximum dynamic flow problem is to send a maximum amount of flow from a source to a sink within a given time bound T ; conversely, the quickest flow problem is to send a given flow amount v from the source to the sink in the shortest possible time. These dynamic flow problems have been studied previously and can be solved via simple minimum cost flow computations. More complicated dynamic flow problems have numerous applications and have been studied extensively. There are no polynomial time algorithms known for many of these problems, including the quickest flow problem with just two sources, each with a flow amount that must reach a single sink. The general multiple source quickest flow problem is commonly used as a model for building evacuation; we also call it the evacuation problem. In this paper we consider t...
Source: eCommons (Cornell University)
Authors: Bruce Hoppe, Éva Tardos
Institution: Cornell University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2028316882
