{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:16:45Z","timestamp":1725560205500},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540200642"},{"type":"electronic","value":"9783540396581"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39658-1_8","type":"book-chapter","created":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T23:24:30Z","timestamp":1279841070000},"page":"55-66","source":"Crossref","is-referenced-by-count":4,"title":["On Approximating a Geometric Prize-Collecting Traveling Salesman Problem with Time Windows"],"prefix":"10.1007","author":[{"given":"Reuven","family":"Bar-Yehuda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy","family":"Even","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shimon","family":"Shahar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/3-540-45471-3_4","volume-title":"Algorithm Theory - SWAT 2002","author":"J. Augustine","year":"2002","unstructured":"Augustine, J., Seiden, S.S.: Linear Time Approximation Schemes for Vehicle Scheduling. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol.\u00a02368, pp. 30\u201339. Springer, Heidelberg (2002)"},{"key":"8_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry \u2013 Algorithms and Applications","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwartzkopf, O.: Computational Geometry \u2013 Algorithms and Applications. Springer, Heidelberg (2000)"},{"key":"8_CR3","first-page":"463","volume":"2","author":"P. Erd\u00f6s","year":"1935","unstructured":"Erd\u00f6s, P., Szekeres, G.: A combinatorial problem in geometry. Compositio Math.\u00a02, 463\u2013470 (1935)","journal-title":"Compositio Math."},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0012-365X(75)90103-X","volume":"11","author":"M.L. Fredman","year":"1975","unstructured":"Fredman, M.L.: On computing the length of longest increasing subsequences. Discrete Math.\u00a011, 29\u201335 (1975)","journal-title":"Discrete Math."},{"key":"8_CR5","unstructured":"Karuno, Y., Nagamochi, H., Ibaraki, T.: A 1.5-approximation for single-vehicle scheduling problem on a line with release and handling times. Technical Report 98007 (1998)"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/3-540-44676-1_18","volume-title":"Algorithms - ESA 2001","author":"Y. Karuno","year":"2001","unstructured":"Karuno, Y., Nagamochi, H.: A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 218\u2013229. Springer, Heidelberg (2001)"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1002\/net.3230220305","volume":"22","author":"J.N. Tsitsiklis","year":"1992","unstructured":"Tsitsiklis, J.N.: Special Cases of Traveling Salesman and Repairman Problems with Time Windows. Networks\u00a022, 263\u2013282 (1992)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39658-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,7]],"date-time":"2020-06-07T11:03:48Z","timestamp":1591527828000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39658-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540200642","9783540396581"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39658-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}