The Online Transportation Problem

  title={The Online Transportation Problem},
  author={Bala Kalyanasundaram and Kirk Pruhs},
  journal={SIAM J. Discrete Math.},
We study the online transportation problem. We show that the halfopt-competitive ratio for the greedy algorithm is (min(m; logC)), 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 modi cation of the greedy algorithm and that has a halfopt-competitive ratio of O(1). 

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-5 of 5 references

Algorithms for Network

  • Je Kennington, Richard Helgason
  • 1980
2 Excerpts

Combinatorial Optimization: Networks and Matriods

  • Eugene Lawler
  • Sanders College Publishing,
  • 1976
2 Excerpts

Similar Papers

Loading similar papers…