On the Bahncard problem
Open accessThe DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“We present a simple randomized strategy which improves the best known competitive ratio from 2 / ln 2 = 2 . 88 to e .”
From Rent, Lease, or Buy: Randomized Algorithms for Multislope Ski Rental (2012) · cites this paper as [6]
In the citing paper
“It follows that the strategies from [3, 4, 6] that were designed for the case of buying slopes 'from scratch' also work for the general non-additive case.”
From Rent, Lease, or Buy: Randomized Algorithms for Multislope Ski Rental (2012) · cites this paper as [6]
In the citing paper
“For deterministic strategies, [6] gives an upper bound of 4 and a lower bound of 5+ √ 5 2 ≈ 3 . 618; [6] also presents a randomized strategy whose competitive factor is 2 / ln 2 = 2 . 88.”
From Rent, Lease, or Buy: Randomized Algorithms for Multislope Ski Rental (2012) · cites this paper as [6]
Citations
Cites
Amortized efficiency of list update and paging rules
Sleator, D. D., & Tarjan, R. E. (1985) · Communications of the ACM · doi:10.1145/2786.2793 · Cited by 2,123
Data Structures and Network Algorithms
Tarjan, R. E. (1983) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970265 · Cited by 2,057
Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Johnson, D. S., Demers, A., Ullman, J. D., Garey, M. R., & Graham, R. L. (1974) · SIAM Journal on Computing · doi:10.1137/0203025 · Cited by 911
Karlin, A. R., Manasse, M. S., Rudolph, L., & Sleator, D. D. (1988) · Algorithmica · doi:10.1007/bf01762111 · Cited by 631
On the power of randomization in on-line algorithms
Ben-David, S., Borodin, A., Karp, R., Tardos, G., & Wigderson, A. (1994) · Algorithmica · doi:10.1007/bf01294260 · Cited by 262
Competitive randomized algorithms for nonuniform problems
Karlin, A. R., Manasse, M. S., McGeoch, L. A., & Owicki, S. (1994) · Algorithmica · doi:10.1007/bf01189993 · Cited by 258
Memory versus randomization in on-line algorithms: Extended abstract
Raghavan, P., & Snir, M. (1989) · Lecture notes in computer science · doi:10.1007/bfb0035792 · Cited by 113
Competitive algorithms for replication and migration problems
Black, D. L., & Sleator, D. D. (2009) · KiltHub Repository · doi:10.1184/r1/6604253 · Cited by 98
Fleischer, R. (1998) · Lecture notes in computer science · doi:10.1007/3-540-68535-9_10 · Cited by 95
Self-citationOn-line distributed data management
Lund, C., Reingold, N., Westbrook, J., & Yan, D. (1994) · Lecture notes in computer science · doi:10.1007/bfb0049409 · Cited by 34
Cited by
Dynamic TCP acknowledgement and other stories about e/(e-1)
Karlin, A. R., Mathieu, C., & Randall, D. (2001) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/380752.380845 · Cited by 155
The Primal-Dual method for Learning Augmented AlgorithmsPreprint
Bamas, É., Maggiori, A., & Svensson, O. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.11632 · Cited by 133
Optimal Online Multi-Instance Acquisition in IaaS Clouds
Wang, W., Liang, B., & Li, B. (2014) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2014.2385697 · Cited by 101
A guessing game and randomized online algorithms
Seiden, S. S. (2000) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/335305.335385 · Cited by 91
Algorithms for optimizing the bandwidth cost of content delivery
Adler, M., Sitaraman, R. K., & Venkataramani, H. (2011) · Computer Networks · doi:10.1016/j.comnet.2011.07.015 · Cited by 83
Metadata
- Authors
- Fleischer, R.
- Affiliations
- Max Planck Society (DE)
- Corresponding author
- Fleischer, Rudolf
- Venue
- Theoretical Computer Science
- Publisher
- Elsevier BV
- Published
- 2001-10
- Volume
- 268
- Issue
- 1
- Pages
- 161-174
- ISSN
- 0302-9743 (ISSN-L)
- 0304-3975
- OpenAlex
- W1543105347
- Cited by
- 97
- References
- 12
- Citations by year
- 2026: 3 · 2025: 4 · 2024: 5 · 2023: 2 · 2022: 4 · 2021: 3 · 2020: 4 · 2019: 6 · 2018: 4 · 2017: 3 · 2016: 5 · 2015: 8 · 2014: 7 · 2013: 2 · 2012: 2
- FWCI
- 1.50
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- www.elsevier.com/open-access/userlicense/1.0/ (vor, 4307 d)
- Locations
- Lecture notes in computer science (publishedVersion)
- Theoretical Computer Science (publishedVersion)
- OpenGrey (Institut de l'Information Scientifique et Technique) (submittedVersion)
- Max Planck Institute for Plasma Physics (submittedVersion)
- MPG.PuRe (Max Planck Society) (submittedVersion)
- MPG.PuRe (Max Planck Society) (submittedVersion, other-oa)
- Untitled Event
- Topics
- Physical Sciences › Mathematics › Theoretical Computer Science › Optimization and Search Problems
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Keywords
- ski rental problem, online algorithms, deterministic online algorithms, randomized online algorithms, competitive analysis, lower bounds, greedy algorithm, Deutsche Bundesbahn
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the Bahncard problem. https://app.cochat.ai/papers/10.1016/s0304-3975(00)00266-8
- The paper
- Fleischer, R. (2001). On the Bahncard problem. Theoretical Computer Science. https://doi.org/10.1016/s0304-3975(00)00266-8
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.