The online transportation problem
| Author(s) : | Bala Kalyanasundaram Kirk R. Pruhs, |
| Publisher : | N/A |
| Publication Date : | 1995 |
| ISSN : | N/A |
| Abstract : | We study the online transportation problem. We show that the halfopt-competitive ratio for the greedy algorithm is \Theta(min(m; log C)), where m is the number of server sites, and C is the total number of servers. We also present an algorithm Balance that is a modification of the greedy algorithm and that has a halfopt-competitive ratio of O(1). 1, |