On the bahncard problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1449, Issue , 1998, Pages 65-74

  Fleischer, Rudolf ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; RAILROADS;

BAHNCARD PROBLEMS; DETERMINISTIC ONLINE ALGORITHMS; GERMAN RAILWAYS; GREEDY ALGORITHMS; ON-LINE ALGORITHMS; ONLINE PROBLEMS; PRICE REDUCTIONS; SKI-RENTAL PROBLEMS;

RAILROAD TRANSPORTATION;

EID: 25144473246     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68535-9_10     Document Type: Conference Paper

References (12)

1. S. Albers and H. Koga. New on-line algorithms for the page replication problem. In Proceedings of the 4th Scandinavian Workshop on Algorithm Theory (SWAT'94). Springer Lecture Notes in Computer Science 824, pages 25-36, 1994. 65, 73.
2. Y. Azar, Y. Bart al, E. Feuerstein, A. Fiat, S. Leonardi, and A. Rosén. On capital investment. In Proceedings of the 23rd International Colloquium on Automata, Languages and Programming (ICALP'96). Springer Lecture Notes in Computer Science 1099, pages 429-441, 1996. 65.
3. S. Ben-David, A. Borodin, R. Ka rp, G. Tardos, and A. Wi gderson. On the power of randomization in on-line algorithms. Algorithmica, 11(1): 2-14, 1994. 66, 68.
4. D. L. Black and D. D. Sleator. Competitive algorithms for replication and migration problems. Technical Report CMU-CS-89-201, Carnegie Mellon University, 1989. 65, 71.
5. R. Fleischer. On the Bahncard problem. Technical Report MPI-I-97-1-018, Max-Planck-Institut für Informatik, 66123 Saarbrücken, Germany, September 1997. 67.
6. D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey, and R. L. Graham. Worstcase performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing, 3(4): 299-325, 1974. 66.
7. A. R. Karlin, M. S. Manasse, L. A. McGeoch, and S. Owicki. Competitive randomized algorithms for nonuniform problems. Algorithmica, 11(6): 542-571, 1994. 65.
8. C. Lund, N. Reingold, J. Westbrook, and D. Yan. On-line distributed data management. In Proceedings of the 2nd European Symposium on Algorithms (ESA'94). Springer Lecture Notes in Computer Science 855, pages 202-214, 1994. 65, 73.
9. P. Raghavan. Lecture notes on randomized algorithms. Technical Report RC 15340 1/9/90, IBM Research Division, T. J. Watson Research Center, Yorktown Heights, New York, 1990. 65.
10. P. Raghavan and M. Snir. Memory versus randomization in on-line algorithms. In Proceedings of the 16th International Colloquium on Automata, Languages and Programming (ICALP'89). Springer Lecture Notes in Computer Science 372, pages 687-703, 1989. 70.
11. D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28(2): 202-208, 1985. 66.
12. R. E. Tarjan. Data Structures and Network Algorithms. CBMS-NSF Regional Conference Series in Applied Mathematics. S IAM, Philadelphia, Pennsylvania, 1983. 70.