The online transportation problem

SIAM Journal on Discrete Mathematics

Volumn 13, Issue 3, 2000, Pages 370-383

  Kalyanasundaram, Bala ^a   Pruhs, Kirk R ^a  

^a University of Pittsburgh   (United States)

Author keywords

Competitive analysis; Matching; Online algorithms

Indexed keywords

EID: 0005369089     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480198342310     Document Type: Article

References (10)

1. A. BORODIN AND R EL-YANIV, Online Computation and Competitive Analysis, Cambridge University Press, Cambridge, UK, 1998.
2. A. FIAT AND G. WOEGINGER, Competitive odds and ends, in On-Line Algorithms: The State of the Art, A. Fiat and G. Woeginger, eds., Lecture Notes in Comput. Sci. 1442, Springer-Verlag, New York, 1998, pp. 385-394.
3. B. KALYANASUNDARAM AND K. PRUHS, Online weighted matching, J. Algorithms, 14 (1993), pp. 478-488.
4. J. KENNINGTON AND R. HELGASON, Algorithms for Network Programming, John Wiley, New York, 1980.
5. S. KHULLER, S. MITCHELL, AND V. VAZIRANI, On-line algorithms for weighted matchings and stable marriages, Theoret. Comput. Sci., 127 (1994), pp. 255-267.
6. E. LAWLER, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart, and Winston, New York, Montreal, London, 1976.
7. K. PRUHS, A Survey of Resource Augmentation Analysis, in preparation.
8. D. SLEATOR AND R. TARJAN, Amortized efficiency of list update and paging rules, Comm. ACM, 28 (1985), pp. 202-208.
9. Y. T. TSAI, C. Y. TANG, AND Y. Y. CHEN, Average performance of a greedy algorithm for the on-line minimum matching problem on Euclidean space, Inform. Process. Lett., 51 (1994), pp. 275-282.
10. N. YOUNG, The k-server dual and loose competitiveness for paging, Algorithmica, 11 (1994), pp. 525-541.