论文信息 - The Online Transportation Problem: On the Exponential Boost of One Extra Server

The Online Transportation Problem: On the Exponential Boost of One Extra Server

We present a poly-log-competitive deterministic online algorithm for the online transportation problem on hierarchically separated trees when the online algorithm has one extra server per site. Using metric embedding results in the literature, one can then obtain a poly-log-competitive randomized online algorithm for the online transportation on an arbitrary metric space when the online algorithm has one extra server per site.

Kirk Pruhs | Christine Chung | Patchrawat Uthaisombut

[1] Bala Kalyanasundaram,et al. Online Weighted Matching , 1993, J. Algorithms.

[2] Adam Meyerson,et al. Randomized online algorithms for minimum metric bipartite matching , 2006, SODA '06.

[3] Samir Khuller,et al. On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages , 1991, Theor. Comput. Sci..

[4] Yair Bartal,et al. On approximating arbitrary metrices by tree metrics , 1998, STOC '98.

[5] R. V. Helgason,et al. Algorithms for network programming , 1980 .

[6] Bala Kalyanasundaram,et al. On-line Network Optimization Problems , 1996, Online Algorithms.

[7] Mohammad Taghi Hajiaghayi,et al. Oblivious network design , 2006, SODA '06.

[8] Bala Kalyanasundaram,et al. The Online Transportation Problem , 2000, SIAM J. Discret. Math..

[9] Satish Rao,et al. A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.

[10] Samir Khuller,et al. On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages , 1994, Theor. Comput. Sci..

[11] Béla Csaba,et al. A randomized algorithm for the on-line weighted bipartite matching problem , 2008, J. Sched..

[12] Sudipto Guha,et al. Approximating a finite metric by a small number of tree metrics , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).