{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:37:12Z","timestamp":1725521832940},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001423"},{"type":"electronic","value":"9783540361367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36136-7_42","type":"book-chapter","created":{"date-parts":[[2008,11,25]],"date-time":"2008-11-25T14:07:11Z","timestamp":1227622031000},"page":"476-488","source":"Crossref","is-referenced-by-count":10,"title":["Average-Case Competitive Analyses for Ski-Rental Problems"],"prefix":"10.1007","author":[{"given":"Hiroshi","family":"Fujiwara","sequence":"first","affiliation":[]},{"given":"Kazuo","family":"Iwama","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"S. al-Binali, \u201cThe competitive analysis of risk taking with applications to online trading\u201d, Proc. 38th IEEE FOCS, pp. 336\u2013344, 1997.","DOI":"10.1109\/SFCS.1997.646122"},{"key":"42_CR2","unstructured":"A. Borodin and R. El-Yaniv, \u201cOnline computation and competitive analysis\u201d, Cambridge University Press, 1998."},{"key":"42_CR3","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1006\/jcss.1995.1021","volume":"50","author":"A. Borodin","year":"1995","unstructured":"A. Borodin, S. Irani, P. Raghavan and B. Schieber, \u201cCompetitive paging with locality of reference\u201d, J. Comput. Sys. Sci., 50, pp. 244\u2013258, 1995.","journal-title":"J. Comput. Sys. Sci."},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"A. Borodin, N. Linial and M. Saks, \u201cAn optimal online algorithms for metric task systems\u201d, J. of the ACM, pp. 745\u2013763, 1992.","DOI":"10.1145\/146585.146588"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"M. Chrobak and J. Noga, \u201cLRU is better than FIFO\u201d, Algorithmica, Vol.23, No.2, 1999.","DOI":"10.1007\/PL00009255"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"D. R. Dooly, S. A. Goldman and S. D. Scott, \u201cTCP Dynamic Acknowledgment Delay: Theory and Practice (Extended Abstract)\u201d, Proc. STOC\u2019 98, pp. 389\u2013398, 1998.","DOI":"10.1145\/276698.276792"},{"key":"42_CR7","doi-asserted-by":"crossref","unstructured":"R. El-Yaniv, A. Fiat, R. M. Karp and G. Turpin, \u201cCompetitive analysis of financial games\u201d, Proc. 33rd IEEE FOCS, pp. 327\u2013333, 1992.","DOI":"10.1109\/SFCS.1992.267758"},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"A. Fiat and G. J. Woeginger (Eds.), \u201cOnline Algorithms\u201d, Springer, Chap.16, 1998.","DOI":"10.1007\/BFb0029561"},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"R. Fleischer, \u201cOn The Bahncard Problem\u201d, Proc. TCS\u201901, pp. 161\u2013174, 2001.","DOI":"10.1016\/S0304-3975(00)00266-8"},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"M. Halldorsson, K. Iwama, S. Miyazaki and S. Taketomi, \u201cOnline Independent Sets\u201d, Proc. COCOON\u201900, pp. 202\u2013209, 2000.","DOI":"10.1007\/3-540-44968-X_20"},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"K. Iwama and K. Yonezawa, \u201cUsing Generalized Forecasts for Online Currency Conversion\u201d, Proc. COCOON\u201999, pp. 409\u2013421, 1999.","DOI":"10.1007\/3-540-48686-0_41"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"A. R. Karlin, M. S. Manasse, L. McGeogh and S. Owicki, \u201cCompetitive Randomize Algorithms for Nonuniform Problems\u201d, Algorithmica, Vol.11, No.1, January, 1994.","DOI":"10.1007\/BF01189993"},{"key":"42_CR13","doi-asserted-by":"crossref","unstructured":"A. R. Karlin, C. Kenyon and D. Randall, \u201cDynamic TCP Acknowledgement and Other Stories about e\/(e-1)\u201d, Proc. STOC\u2019 01, pp. 502\u2013509, 2001.","DOI":"10.1145\/380752.380845"},{"key":"42_CR14","first-page":"416","volume":"1","author":"R. Karp","year":"1992","unstructured":"R. Karp, \u201cOn-line algorithms versus off-line algorithms: How Much is it Worth to Know the Future?\u201d, Proc. IFIP 12th World Computer Congress, Vol.1, pp. 416\u2013429, 1992.","journal-title":"Proc. IFIP 12th World Computer Congress"},{"key":"42_CR15","unstructured":"E. Koutsoupias and C. Papadimitriou, \u201cBeyond competitive analysis,\u201d Proc. 35th IEEE FOCS, pp. 394\u2013400, 1994."},{"key":"42_CR16","unstructured":"S. Moriguchi, K. Udagawa and S. Hitotsumatsu, \u201cMathematics Formulas I\u201d, Iwanami Shoten, Publishers, 1956."},{"key":"42_CR17","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1090\/dimacs\/007\/05","volume":"7","author":"P. Raghavan","year":"1992","unstructured":"P. Raghavan, \u201cA statistical adversary for on-line algorithms,\u201d DIM ACS Series in Discrete Mathematics and Theoretical Computer Science, 7, pp. 79\u201383, 1992.","journal-title":"DIM ACS Series in Discrete Mathematics and Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36136-7_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T14:29:01Z","timestamp":1557930541000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36136-7_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001423","9783540361367"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-36136-7_42","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}