Free Access
| Issue |
RAIRO-Oper. Res.
Volume 55, 2021
Regular articles published in advance of the transition of the journal to Subscribe to Open (S2O). Free supplement sponsored by the Fonds National pour la Science Ouverte
|
|
|---|---|---|
| Page(s) | S2393 - S2401 | |
| DOI | https://doi.org/10.1051/ro/2020092 | |
| Published online | 02 March 2021 | |
- I. Ahmad, M.I.K. Khalil and S.A.A. Shah, Optimization-based workload distribution in geographically distributed data centers: a survey. Int. J. Commun. Syst. 33 (2020) e4453. [Google Scholar]
- S. Albers, Online algorithms: a survey. Math. Prog. 97 (2003) 3–26. [Google Scholar]
- S. Angelopoulos and P. Schweitzer, Paging and list update under bijective analysis. J. ACM 60 (2013) 7:1–7:18. [Google Scholar]
- S. Angelopoulos, R. Dorrigiv and A. López-Ortiz, On the separation and equivalence of paging strategies. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA ’07. Society for Industrial and Applied Mathematics. Philadelphia, PA (2007) 229–237. [Google Scholar]
- J. Boyar, K.S. Larsen and A. Maiti, A comparison of performance measures via online search. Theor. Comput. Sci. 532 (2014) 2–13. [Google Scholar]
- R. Dorrigiv, A. López-Ortiz and J. Ian Munro, On the relative dominance of paging algorithms. Theor. Comput. Sci. 410 (2009) 3694–3701. [Google Scholar]
- R. El-Yaniv, A. Fiat, R.M. Karp and G. Turpin, Competitive analysis of financial games. In: IEEE Symposium on Foundations of Computer Science, Manhattan, NY (1992) 327–333. [Google Scholar]
- R. El-Yaniv, A. Fiat, R.M. Karp and G. Turpin, Optimal search and one-way trading online algorithms. Algorithmica 30 (2001) 101–139. [Google Scholar]
- H. Fujiwara, K. Iwama and Y. Sekiguchi, Average-case competitive analyses for one-way trading. J. Comb. Optim. 21 (2011) 83–107. [Google Scholar]
- J. Iqbal and I. Ahmad, Optimal online k-min search. EURO J. Comput. Optim. 3 (2015) 147–160. [Google Scholar]
- J. Iqbal, I. Ahmad and A. Shah, Disparity between theory & practice: Beyond the worst-case competitive analysis. In: 2018 IEEE 5th International Conference on Engineering Technologies and Applied Sciences (ICETAS). IEEE, Manhattan, NY (2018) 1–6. [Google Scholar]
- E. Mohr, I. Ahmad and G. Schmidt, Online algorithms for conversion problems: a survey. Surv. Oper. Res. Manage. Sci. 19 (2014) 87–104. [Google Scholar]
- D. Sleator and R. Tarjan, Amortized efficiency of list update and paging rules. Commun. ACM 28 (1985) 202–208. [Google Scholar]
- N. Young, The k-server dual and loose competitiveness for paging. Algorithmica 11 (1994) 525–541. [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.