Skip to main content
SpringerLink
Log in
Book cover

European Symposium on Algorithms

ESA 1995: Algorithms — ESA '95 pp 484–493Cite as

The online transportation problem

  • Session 8. Chair: Michael Juenger
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 979))

Abstract

We study the online transportation problem under the weakened adversary model. More specifically, we assume that the adversary has only half at many servers at each site as the online algorithm. We show that the halfopt-competitive ratio for the greedy algorithm is θ(min(m, log C)), 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 has a halfopt-competitive ratio of O(1).

Supported in part by NSF under grant CCR-9202158.

Supported in part by NSF under grant CCR-9209283.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Kalyanasundaram, and K. Pruhs, “Online weighted matching”, Journal of Algorithms, 14, 478–488, 1993.

    Google Scholar 

  2. B. Kalyanasundaram, and K. Pruhs, “Speed is as powerful as clairvoyance”, Technical Report, Computer Science Dept., University of Pittsburgh, 1995.

    Google Scholar 

  3. Jeff Kennington, and Richard Helgason, Algorithms for Network Programming, John Wiley and Sons, 1980.

    Google Scholar 

  4. S. Khuller, S. Mitchell, and V. Vazirani, “On-line algorithms for weighted matchings and stable marriages”, Theoretical Computer Science, 127(2), 255–267, 1994.

    Google Scholar 

  5. Elias Koutsoupias, and Christos Papadimitriou, “Beyond competitive analysis”, FOCS, 394–400, 1994.

    Google Scholar 

  6. Eugene Lawler, Combinatorial Optimization: Networks and Matriods, Sanders College Publishing, 1976.

    Google Scholar 

  7. Daniel Sleator and Robert Tarjan, “Amortized efficiency of list update and paging rules”, Communications of the ACM, 28, 202–208, 1985.

    Article  Google Scholar 

  8. Ying Teh Tsai, Chuan Yi Tang and Yunn Yen Chen, “Average performance of a greedy algorithm for the on-line minimum matching problem on Euclidean space”, Information Processing Letters, 1994.

    Google Scholar 

  9. N. Young, “The k-server dual and loose competitiveness for paging,” Algorithmica, 11, 525–541, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Dept., University of Pittsburgh, 15260, Pittsburgh, PA

    Bala Kalyanasundaram & Kirk R. Pruhs

Authors
  1. Bala Kalyanasundaram
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kirk R. Pruhs
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Paul Spirakis

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kalyanasundaram, B., Pruhs, K.R. (1995). The online transportation problem. In: Spirakis, P. (eds) Algorithms — ESA '95. ESA 1995. Lecture Notes in Computer Science, vol 979. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60313-1_165

Download citation

  • DOI: https://doi.org/10.1007/3-540-60313-1_165

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60313-9

  • Online ISBN: 978-3-540-44913-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation