Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,232,828 papers from all fields of science
Search
Sign In
Create Free Account
Ski rental problem
The ski rental problem is the name given to a class of problems in which there is a choice between continuing to pay a repeating cost or paying a one…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
3 relations
Competitive analysis (online algorithm)
Online algorithm
Randomized algorithm
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
22: Algorithmen II, Vorlesung und Übung, WS 2019/20, 14.01.2020
P. Sanders
,
S. Lamm
,
Tobias Heuer
,
Zentrum für Mediales Lernen
2020
Corpus ID: 213889672
22 | 0:00:00 Start 0:01:50 Volltextsuche von langsam bis schnell 0:03:43 Invertierter Index 0:09:34 Etwas ""Stringology…
Expand
2018
2018
2 The Ski Rental Problem : Rent or Buy ?
Anupam Gupta
,
Thomas Lavastida
2018
Corpus ID: 53662336
In the standard setting of online algorithms there is a sequence of requests σ = (σ1, σ2, . . . , σt, . . .) received online. An…
Expand
2015
2015
A Simple and General Problem and its Optimal Randomized Online Algorithm Design with Competitive Analysis
Ying Zhang
arXiv.org
2015
Corpus ID: 5813074
The online algorithm design was proposed to handle the caching problem when the future information is unknown. And currently, it…
Expand
2015
2015
Cost Aware Caching in Content Centric Networking by Applying Ski Rental Problem
K. Thar
,
Saeed Ullah
,
Chit Wutyee Zaw
,
C. Hong
2015
Corpus ID: 113403247
Content Centric Networking (CCN) is one of the most promising network architectures for future Internet. In CCN, Content Router…
Expand
2015
2015
2 Online Algorithms 2.1 Ski Rental Problem (rent-or-buy)
D. Panigrahi
,
Allen Xiao
2015
Corpus ID: 47768052
Online algorithms use a different model from what we’ve seen so far: the algorithm does not have the entire input at its…
Expand
2013
2013
Online Vertex Cover and Matching: Beating the Greedy Algorithm
Yajun Wang
,
S. Wong
arXiv.org
2013
Corpus ID: 15223618
In this paper, we explicitly study the online vertex cover problem, which is a natural generalization of the well-studied ski…
Expand
2013
2013
Competitive Algorithms for Online Matching and Vertex Cover Problems
C. W. Wong
2013
Corpus ID: 1254748
The past decade has witnessed an explosion of research on the online bipartite matching problem. Surprisingly, its dual problem…
Expand
2008
2008
Ski Rental Problem with Dynamic Pricing
Marcin Bienkowski
2008
Corpus ID: 16700110
We extend the classical ski rental problem, so that the rental price may evolve with time. We consider several models which…
Expand
2006
2006
2 Ski Rental Problem 2.1 Problem Setup
2006
Corpus ID: 14185595
1 Outline In this recitation, we used competitive analysis to analyze algorithms for two different problems: • Ski Rental Problem…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE