On the Bahncard problem

Fleischer, Rudolf

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

On the Bahncard problem

MPS-Authors

/persons/resource/persons44431

Fleischer, Rudolf
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Fleischer, R. (1998). On the Bahncard problem. In W.-L., Hsu, & M.-Y., Kao (Eds.), Proceedings of the 4th International Conference on Computing and Combinatorics (COCOON-98) (pp. 65-74). Berlin, Germany: Springer.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-37C0-0

要旨

In this paper, we generalize the Ski-Rental Problem to the Bahncard PRoblem which is an online problem of practical relevance for all travelers. The Bahncard is a railway pass of the Deutsche Bundesbahn (the German railway company) which entitles its holder to a 50% price reduction on nearly all train tickets. It costs 240 DM, and it is valid for 12 months. Similar bus or railway passes can be found in many other countries.