A tight bound on the speed-up through storage for quickest multi-commodity flows
Data Structures and Algorithms
2014-06-19 v1
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~.
Cite
@article{arxiv.1406.4799,
title = {A tight bound on the speed-up through storage for quickest multi-commodity flows},
author = {Martin Groß and Martin Skutella},
journal= {arXiv preprint arXiv:1406.4799},
year = {2014}
}