Approximation algorithms for the ring loading problem with penalty cost
Information Processing Letters
| Hi-index | 0.00 |
We study how to route online splittable flows in bidirectional ring networks to minimize maximum load. We show that the competitive ratio of any deterministic online algorithm for this problem is at least $2- 2/n$ **image** , where $n$ **image** is the size of the ring, and that the online algorithm that splits each flow inversely proportionally to the length of the flow's shortest path achieves this competitive ratio for all integers $n \geq 2$ **image** © 2010 Wiley Periodicals, Inc. NETWORKS, Vol. 57(2), 187–197 2011. © 2011 Wiley Periodicals, Inc.