Graph orientation and flows over time
From MaRDI portal
Publication:4642437
DOI10.1002/NET.21623zbMATH Open1390.90089arXiv1409.3081OpenAlexW2174840090MaRDI QIDQ4642437FDOQ4642437
Martin Skutella, Ashwin Arulselvan, Martin Groß
Publication date: 23 May 2018
Published in: Networks (Search for Journal in Brave)
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 of the flow and this bound is tight. For the special case of networks with a single source or sink, this fraction is 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.
Full work available at URL: https://arxiv.org/abs/1409.3081
Recommendations
- Graph orientation and flows over time
- scientific article; zbMATH DE number 851097
- Orientations of graphs
- scientific article; zbMATH DE number 3957181
- scientific article; zbMATH DE number 1146228
- Path-driven orientation of mixed graphs
- Time varying undirected graphs
- Underlying properties of oriented graphs
- On flows in bidirected graphs
Cited In (1)
This page was built for publication: Graph orientation and flows over time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4642437)