{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:07:00Z","timestamp":1743030420737,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020254"},{"type":"electronic","value":"9783642020261"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02026-1_30","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T16:31:23Z","timestamp":1245256283000},"page":"322-333","source":"Crossref","is-referenced-by-count":2,"title":["Optimal Algorithms for the Online Time Series Search Problem"],"prefix":"10.1007","author":[{"given":"Yinfeng","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenming","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feifeng","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Dinitz, M., Gupta, A., Immorlica, N., Talwar, K.: Secretary Problems: Weights and Discounts, \n                      http:\/\/zeno.siam.org\/proceedings\/soda\/2009\/SODA09_135_babaioffm.pdf","DOI":"10.1137\/1.9781611973068.135"},{"issue":"2","key":"30_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1399589.1399596","volume":"7","author":"M. Babaioff","year":"2008","unstructured":"Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.: Online Auctions and Generalized Secretary Problems. ACM SIGecom Exchanges\u00a07(2), 1\u201311 (2008)","journal-title":"ACM SIGecom Exchanges"},{"key":"30_CR3","unstructured":"Damaschke, P., Ha, P.H., Tsigas, P.: Online Search with Time-Varying Price Bounds. Algorithmica (to appear)"},{"issue":"1","key":"30_CR4","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\u00a030(1), 101\u2013139 (2001)","journal-title":"Algorithmica"},{"issue":"3","key":"30_CR5","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1214\/ss\/1177012493","volume":"4","author":"T.S. Ferguson","year":"1989","unstructured":"Ferguson, T.S.: Who Solved the Secretary Problem? Statistical Science\u00a04(3), 282\u2013296 (1989)","journal-title":"Statistical Science"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF01893368","volume":"29","author":"P. Grant","year":"1982","unstructured":"Grant, P.: Secretary Problems with Inspection Costs as a Game. Metrika\u00a029, 87\u201393 (1982)","journal-title":"Metrika"},{"key":"30_CR7","unstructured":"Lorenz, J., Panagiotou, K., Steger, A.: Optimal Algorithms for k-Search with Application in Option Pricing. Algorithmica (to appear)"},{"key":"30_CR8","volume-title":"Optimal Stopping and Free-Boundary Problems","author":"G. Peskir","year":"2006","unstructured":"Peskir, G., Shiryaev, A.: Optimal Stopping and Free-Boundary Problems. Birkh\u00e4user, Basel (2006)"},{"issue":"1","key":"30_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-0531(81)90014-4","volume":"25","author":"D.B. Rosenfield","year":"1981","unstructured":"Rosenfield, D.B., Shapiro, R.D.: Optimal Adaptive Price Search. Journal of Economic Theory\u00a025(1), 1\u201320 (1981)","journal-title":"Journal of Economic Theory"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized Efficiency of List Update and Paging Rules. Communication of the ACM\u00a028, 202\u2013208 (1985)","journal-title":"Communication of the ACM"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02026-1_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:56:03Z","timestamp":1714622163000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-02026-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020254","9783642020261"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02026-1_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}