{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T14:09:28Z","timestamp":1744898968160,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319301389"},{"type":"electronic","value":"9783319301396"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-30139-6_24","type":"book-chapter","created":{"date-parts":[[2016,2,19]],"date-time":"2016-02-19T08:35:02Z","timestamp":1455870902000},"page":"301-312","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Online Algorithms for the Multi-objective Time Series Search Problem"],"prefix":"10.1007","author":[{"given":"Shun","family":"Hasegawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshiya","family":"Itoh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","volume-title":"Online Computation and Competitive Analysis","author":"A Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"24_CR2","volume-title":"Multicriteria Optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization. Springer, Heidelberg (2005)"},{"issue":"1","key":"24_CR3","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s00453-001-0003-0","volume":"30","author":"R El-Yaniv","year":"2001","unstructured":"El-Yaniv, R., Fiat, A., Karp, R.M., Turpin, G.: Optimal search and one-way trading online algorithms. Algorithmica 30(1), 101\u2013139 (2001)","journal-title":"Algorithmica"},{"issue":"1","key":"24_CR4","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1145\/1753171.1753195","volume":"41","author":"MH Goldwasser","year":"2010","unstructured":"Goldwasser, M.H.: A survey of buffer management policies for packet switches. ACM SIGACT New 41(1), 100\u2013128 (2010)","journal-title":"ACM SIGACT New"},{"unstructured":"Hasegawa, S., Itoh, T.: Optimal Online Algorithms for the Multi-Objective Time Series Search Problem. CoRR abs\/1506.04474 (2015)","key":"24_CR5"},{"issue":"2","key":"24_CR6","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.cosrev.2009.04.002","volume":"3","author":"E Koutsoupias","year":"2009","unstructured":"Koutsoupias, E.: The \n                      \n                        \n                      \n                      $$k$$\n                    -server conjecture. Comput. Sci. Rev. 3(2), 105\u2013118 (2009)","journal-title":"Comput. Sci. Rev."},{"issue":"2","key":"24_CR7","first-page":"87","volume":"19","author":"E Mohr","year":"2014","unstructured":"Mohr, E., Ahmad, I., Schmidt, G.: Online algorithms for conversion problems: a survey. Surv. Oper. Res. Manag. Sci. 19(2), 87\u2013104 (2014)","journal-title":"Surv. Oper. Res. Manag. Sci."},{"issue":"2","key":"24_CR8","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1085","unstructured":"Sleator, D.D., Tarjan, R.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202\u2013208 (1085)","journal-title":"Commun. ACM"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-319-15612-5_19","volume-title":"WALCOM: Algorithms and Computation","author":"M Tiedemann","year":"2015","unstructured":"Tiedemann, M., Ide, J., Sch\u00f6bel, A.: Competitive analysis for multi-objective online algorithms. In: Rahman, M.S., Tomita, E. (eds.) WALCOM 2015. LNCS, vol. 8973, pp. 210\u2013221. Springer, Heidelberg (2015)"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/978-0-387-30162-4_267","volume-title":"Encyclopedia of Algorithms","author":"NE Young","year":"2008","unstructured":"Young, N.E.: Online paging and caching. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms, pp. 601\u2013604. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-30139-6_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:49:24Z","timestamp":1559386164000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-30139-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319301389","9783319301396"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-30139-6_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}