CoChat

On the Bahncard problem

Open access
Fleischer, Rudolf · 2001 · Theoretical Computer Science

The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.

Overview

Integrity signals

Registry

Crossref · 10.1016/s0304-3975(00)00266-8

Cites

12 of 12 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Show all 12 references

Cited by

See all 109

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
Licence
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.