A unified analysis of hot video schedulers
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Randomized online algorithms for minimum metric bipartite matching
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
An O(log2k)-competitive algorithm for metric bipartite matching
ESA'07 Proceedings of the 15th annual European conference on Algorithms
The online transportation problem: on the exponential boost of one extra server
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
On the refinement of liveness properties of distributed systems
Formal Methods in System Design
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
We study the online transportation problem under the assumption that the adversary has only half as many servers at each site as the online algorithm. We show that the GREEDY algorithm is $\Theta( {\rm min}(m, \lg C))$-competitive under this assumption, where m is the number of server sites and C is the total number of servers. We then present an algorithm BALANCE, which is a simple modification of the GREEDY algorithm, that is, O(1)-competitive under this assumption.