On the Bahncard problem
From MaRDI portal
Publication:5958720
DOI10.1016/S0304-3975(00)00266-8zbMath0984.68194MaRDI QIDQ5958720
No author found.
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (14)
Competitive analysis of the online financial lease problem ⋮ Online leasing problem with price fluctuations and the second-hand transaction ⋮ On the remote server problem or more about TCP acknowledgments ⋮ Competitive algorithm for scheduling of sharing machines with rental discount ⋮ Non-linear ski rental ⋮ The ski-rental problem with multiple discount options ⋮ Competitive analysis for online leasing problem with compound interest rate ⋮ Dynamic work hour optimization for casual workers ⋮ Online leasing problem with price fluctuations under the consumer price index ⋮ On the best possible competitive ratio for the multislope ski-rental problem ⋮ Dynamic TCP acknowledgment with sliding window ⋮ Non-additive two-option ski rental ⋮ Rent or buy problems with a fixed time horizon ⋮ Non-Additive Two-Option Ski Rental
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Competitive snoopy caching
- On the power of randomization in on-line algorithms
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- New On-Line Algorithms for the Page Replication Problem
- Competitive On-Line Algorithms for Distributed Data Management
This page was built for publication: On the Bahncard problem
