{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:51:12Z","timestamp":1725544272943},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540322078"},{"type":"electronic","value":"9783540322085"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11671411_18","type":"book-chapter","created":{"date-parts":[[2006,2,15]],"date-time":"2006-02-15T09:26:35Z","timestamp":1139995595000},"page":"230-243","source":"Crossref","is-referenced-by-count":1,"title":["The Online Target Date Assignment Problem"],"prefix":"10.1007","author":[{"given":"S.","family":"Heinz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. O.","family":"Krumke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Megow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Rambau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Tuchscherer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Vredeveld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"18_CR1","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/s004530010071","volume":"29","author":"G. Ausiello","year":"2001","unstructured":"Ausiello, G., Feuerstein, E., Leonardi, S., Stougie, L., Talamo, M.: Algorithms for the online travelling salesman. Algorithmica\u00a029(4), 560\u2013581 (2001)","journal-title":"Algorithmica"},{"key":"18_CR2","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":"18_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Online algorithms, the state of the art","year":"1998","unstructured":"Fiat, A., Woeginger, G.J. (eds.): Online algorithms, the state of the art. LNCS, vol.\u00a01442. Springer, Heidelberg (1998)"},{"key":"18_CR4","volume-title":"Computers and intractability (a guide to the theory of NP-completeness)","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability (a guide to the theory of NP-completeness). W.H. Freeman and Company, New York (1979)"},{"key":"18_CR5","volume-title":"Markov decision processes","author":"M.L. Putermann","year":"2005","unstructured":"Putermann, M.L.: Markov decision processes. Wiley Interscience, Chichester (2005)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11671411_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:14:23Z","timestamp":1619507663000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11671411_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540322078","9783540322085"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/11671411_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}