de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

On the Bahncard problem

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44431

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

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

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.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-37C0-0
Abstract
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.