Optimal algorithms for the online time series search problem
From MaRDI portal
Publication:621833
DOI10.1016/j.tcs.2009.09.026zbMath1209.68662OpenAlexW4256193557MaRDI QIDQ621833
Feifeng Zheng, Wen-Ming Zhang, Yin-Feng Xu
Publication date: 28 January 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.09.026
Related Items (12)
Online Two Stage k-Search Problem and Its Competitive Analysis ⋮ Competitive difference analysis of the one-way trading problem with limited information ⋮ An online trading problem with an increasing number of available products ⋮ Competitive analysis of bi-directional non-preemptive conversion ⋮ Online algorithms for the general \(k\)-search problem ⋮ Optimal replenishment under price uncertainty ⋮ COMPETITIVE ANALYSIS OF INTERRELATED PRICE ONLINE INVENTORY PROBLEMS WITH DEMANDS ⋮ Online \((J, K)\)-search problem and its competitive analysis ⋮ Online algorithms for the multiple time series search problem ⋮ Optimal online \(k\)-min search ⋮ Advice Complexity of the Online Search Problem ⋮ Online k-max Search Algorithms with Applications to the Secretary Problem
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal algorithms for \(k\)-search with application in option pricing
- Online search with time-varying price bounds
- Optimal adaptive price search
- Secretary problems with inspection costs as a game
- Who solved the secretary problem
- Optimal search and one-way trading online algorithms
This page was built for publication: Optimal algorithms for the online time series search problem