pith. sign in

arxiv: 1406.4799 · v1 · pith:HDYBGIK2new · submitted 2014-06-18 · 💻 cs.DS

A tight bound on the speed-up through storage for quickest multi-commodity flows

classification 💻 cs.DS
keywords speed-upfactorstorageflowflowsinstancesmulti-commodityallow
0
0 comments X
read the original 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~$2$, and that there are instances where the speed-up is as large as a factor of~$4/3$. We close this gap by presenting a family of instances for which the speed-up factor through storage converges to~$2$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.