On the Bahncard problem
From MaRDI portal
Recommendations
Cites work
- Competitive On-Line Algorithms for Distributed Data Management
- Competitive snoopy caching
- scientific article; zbMATH DE number 432777 (Why is no real title available?)
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 2102767 (Why is no real title available?)
- New On-Line Algorithms for the Page Replication Problem
- On the power of randomization in on-line algorithms
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Cited in
(19)- Dynamic TCP acknowledgment with sliding window
- Dynamic work hour optimization for casual workers
- The ski-rental problem with multiple discount options
- Online leasing problem with price fluctuations and the second-hand transaction
- Competitive algorithm for scheduling of sharing machines with rental discount
- Competitive risk management for online Bahncard problem
- Non-additive two-option ski rental
- Rent or buy problems with a fixed time horizon
- Non-additive two-option ski rental
- Competitive analysis of the online financial lease problem
- scientific article; zbMATH DE number 1222820 (Why is no real title available?)
- Algorithmic Applications in Management
- On the best possible competitive ratio for the multislope ski-rental problem
- Non-linear ski rental
- Competitive analysis for online leasing problem with compound interest rate
- On the multi-kind BahnCard problem
- A learning-augmented algorithm for the parking permit problem with three permit types
- Online leasing problem with price fluctuations under the consumer price index
- On the remote server problem or more about TCP acknowledgments
This page was built for publication: On the Bahncard problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958720)
