Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

ENDM
2010

favoriteEmaildiscussreport

72views more ENDM 2010»

Earliest Arrival Flows in Networks with Multiple Sinks

13 years 4 months ago

Earliest Arrival Flows in Networks with Multiple Sinks

Download www.math.tu-berlin.de

Earliest arrival flows model a central aspect of evacuation planning: In a dangerous situation, as many individuals as possible should be rescued at any point in time. Unfortunately, given a network with multiple sinks, flows over time satisfying this condition do not always exist. We analyze the special case of flows over time with zero transit times and characterize which networks always allow for earliest arrival flows.

Melanie Schmidt, Martin Skutella

Real-time Traffic

Central Aspect | Earliest Arrival | ENDM 2010 | Flows Model |

claim paper

Related Content

» Earliest arrival flows on seriesparallel graphs

» Rainbow Network Flow of Multiple Description Codes

» Single Source Multiroute Flows and Cuts on Uniform Capacity Networks

» Capacitated Confluent Flows Complexity and Algorithms

» Polymatroids with Network Coding

» Optimal Flow Distribution Among Multiple Channels with Unknown Capacities

» Fast Fair and Efficient Flows in Networks

» A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks T...

» On Traffic LongRange Dependence at the Output of Schedulers with Multiple Service Classes

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2010
Where	ENDM
Authors	Melanie Schmidt, Martin Skutella

Comments (0)