A tight bound on the speed-up through storage for quickest multi-commodity flows
From MaRDI portal
(Redirected from Publication:1785329)
Abstract: Multi-commodity flows over time exhibit the non-intuitive property that letting flow wait can allow us to send flow faster overall. Fleischer and Skutella (IPCO~2002) show that the speed-up through storage is at most a factor of~, and that there are instances where the speed-up is as large as a factor of~. We close this gap by presenting a family of instances for which the speed-up factor through storage converges to~.
Recommendations
Cites work
- scientific article; zbMATH DE number 2086912 (Why is no real title available?)
- An introduction to network flows over time
- Constructing maximal dynamic flows from static flows
- Multicommodity flows over time: Efficient algorithms and complexity
- Quickest Flows Over Time
- The quickest flow problem
- Traffic Networks and Flows over Time
- Universal packet routing with arbitrary bandwidths and transit times
This page was built for publication: A tight bound on the speed-up through storage for quickest multi-commodity flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1785329)