Graph orientations and flows over time

Arulselvan, Ashwin and Groß, Martin and Skutella, Martin; Ahn, Hee-Kap and Shin, Chan-Su, eds. (2014) Graph orientations and flows over time. In: Algorithms and Computation. Lecture Notes in Computer Science . Springer, KOR, pp. 741-752. ISBN 9783319130743 (https://doi.org/10.1007/978-3-319-13075-0_58)

Full text not available in this repository.Request a copy

Abstract

Flows over time are used to model many real-world logistic and routing problems. The networks underlying such problems – streets, tracks, etc. – are inherently undirected and directions are only imposed on them to reduce the danger of colliding vehicles and similar problems. Thus the question arises, what influence the orientation of the network has on the network flow over time problem that is being solved on the oriented network. In the literature, this is also referred to as the contraflow or lane reversal problem. We introduce and analyze the price of orientation: How much flow is lost in any orientation of the network if the time horizon remains fixed? We prove that there is always an orientation where we can still send 1/3 of the flow and this bound is tight. For the special case of networks with a single source or sink, this fraction is 1/2 which is again tight. We present more results of similar flavor and also show non-approximability results for finding the best orientation for single and multicommodity maximum flows over time.

ORCID iDs

Arulselvan, Ashwin ORCID logoORCID: https://orcid.org/0000-0001-9772-5523, Groß, Martin and Skutella, Martin; Ahn, Hee-Kap and Shin, Chan-Su
CORE (COnnecting REpositories)