{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:56:55Z","timestamp":1725638215373},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255908"},{"type":"electronic","value":"9783642255915"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-25591-5_3","type":"book-chapter","created":{"date-parts":[[2011,12,2]],"date-time":"2011-12-02T19:32:34Z","timestamp":1322854354000},"page":"10-19","source":"Crossref","is-referenced-by-count":7,"title":["The School Bus Problem on Trees"],"prefix":"10.1007","author":[{"given":"Adrian","family":"Bock","sequence":"first","affiliation":[]},{"given":"Elyot","family":"Grant","sequence":"additional","affiliation":[]},{"given":"Jochen","family":"K\u00f6nemann","sequence":"additional","affiliation":[]},{"given":"Laura","family":"Sanit\u00e0","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1007\/978-3-642-10631-6_100","volume-title":"Algorithms and Computation","author":"A. Adamaszek","year":"2009","unstructured":"Adamaszek, A., Czumaj, A., Lingas, A.: PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of\u00a0k. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 994\u20131003. Springer, Heidelberg (2009)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Asano, T., Katoh, N., Tamaki, H., Tokuyama, T.: Covering points in the plane by k-tours: towards a polynomial time approximation scheme for general k. In: STOC 1997 (1997)","DOI":"10.1145\/258533.258602"},{"issue":"2","key":"3_CR3","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1137\/050645464","volume":"37","author":"A. Blum","year":"2007","unstructured":"Blum, A., Chawla, S., Karger, D.R., Lane, T., Meyerson, A., Minkoff, M.: Approximation Algorithms for Orienteering and Discounted-Reward TSP. SIAM Journal on Computing\u00a037(2), 653\u2013670 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR4","unstructured":"Chekuri, C., Korula, N., Pal, M.: Improved Algorithms for Orienteering and Related Problems. In: SODA, pp. 661\u2013670 (2008)"},{"issue":"4","key":"3_CR5","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1287\/moor.10.4.527","volume":"10","author":"M. Haimovich","year":"1985","unstructured":"Haimovich, M., Rinnoy Kan, A.H.G.: Bounds and heuristic for capacitated routing problems. Mathematics of OR\u00a010(4), 527\u2013542 (1985)","journal-title":"Mathematics of OR"},{"issue":"4","key":"3_CR6","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1287\/opre.39.4.616","volume":"39","author":"M. Labbe","year":"1991","unstructured":"Labbe, M., Laporte, G., Mercure, H.: Capacitated Vehicle Routing on Trees. Operations Research\u00a039(4), 616\u2013622 (1991)","journal-title":"Operations Research"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1002\/net.3230140113","volume":"14","author":"G. Laporte","year":"1984","unstructured":"Laporte, G., Desrochers, M., Norbert, Y.: Two exact algorithms for the Distance Constrained Vehicle Routing Problem. Networks\u00a014, 47\u201361 (1984)","journal-title":"Networks"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1287\/opre.40.4.790","volume":"40","author":"C.-L. Li","year":"1992","unstructured":"Li, C.-L., Simchi-Levi, S., Desrochers, M.: On the distance constrained vehicle routing problem. Operations Research\u00a040, 790\u2013799 (1992)","journal-title":"Operations Research"},{"key":"3_CR9","unstructured":"Nagarajan, V., Ravi, R.: Approximation Algorithms for Distance Constrained Vehicle Routing Problems. Tepper School of Business, Carnegie Mellon University, Pittsburgh (2008)"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/j.ejor.2009.05.017","volume":"202","author":"J. Park","year":"2010","unstructured":"Park, J., Kim, B.-I.: The school bus routing problem: A review. European Journal of Operational Research\u00a0202, 311\u2013319 (2010)","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"3_CR11","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1287\/trsc.1040.0096","volume":"39","author":"M. Spada","year":"2005","unstructured":"Spada, M., Bierlaire, M., Liebling, T.M.: Decision-Aiding Methodology for the School Bus Routing and Scheduling Problem. Transportation Science\u00a039(4), 477\u2013490 (2005)","journal-title":"Transportation Science"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: The Vehicle Routing Problem (2001)","DOI":"10.1137\/1.9780898718515"},{"key":"3_CR13","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25591-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T02:11:26Z","timestamp":1560996686000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25591-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255908","9783642255915"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25591-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}