{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T16:32:05Z","timestamp":1775233925117,"version":"3.50.1"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030247652","type":"print"},{"value":"9783030247669","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-24766-9_9","type":"book-chapter","created":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T23:09:48Z","timestamp":1564528188000},"page":"112-125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A Framework for Vehicle Routing Approximation Schemes in Trees"],"prefix":"10.1007","author":[{"given":"Amariah","family":"Becker","sequence":"first","affiliation":[]},{"given":"Alice","family":"Paul","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,12]]},"reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1023\/A:1011461300596","volume":"5","author":"T Asano","year":"2001","unstructured":"Asano, T., Katoh, N., Kawashima, K.: A new approximation algorithm for the capacitated vehicle routing problem on a tree. J. Comb. Optim. 5(2), 213\u2013231 (2001). https:\/\/doi.org\/10.1023\/A:1011461300596","journal-title":"J. Comb. Optim."},{"key":"9_CR2","unstructured":"Becker, A.: A tight 4\/3 approximation for capacitated vehicle routing in trees. CoRR abs\/1804.08791 (2018). http:\/\/arxiv.org\/abs\/1804.08791"},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00453-012-9711-x","volume":"67","author":"A Bock","year":"2013","unstructured":"Bock, A., Grant, E., K\u00f6nemann, J., Sanit\u00e0, L.: The school bus problem on trees. Algorithmica 67(1), 49\u201364 (2013). https:\/\/doi.org\/10.1007\/s00453-012-9711-x","journal-title":"Algorithmica"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"2801","DOI":"10.1137\/1.9781611975031.178","volume-title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Lin Chen","year":"2018","unstructured":"Chen, L., Marx, D.: Covering a tree with rooted subtrees-parameterized and approximation algorithms. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2801\u20132820. SIAM (2018)"},{"key":"9_CR5","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report, Carnegie-Mellon University Pittsburgh, PA, Management Sciences Research Group (1976)"},{"issue":"4","key":"9_CR6","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.orl.2003.11.010","volume":"32","author":"G Even","year":"2004","unstructured":"Even, G., Garg, N., K\u00f6nemann, J., Ravi, R., Sinha, A.: Min-max tree covers of graphs. Oper. Res. Lett. 32(4), 309\u2013315 (2004). https:\/\/doi.org\/10.1016\/j.orl.2003.11.010","journal-title":"Oper. Res. Lett."},{"key":"9_CR7","doi-asserted-by":"publisher","unstructured":"Friggstad, Z., Swamy, C.: Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing. In: Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing, STOC 2014, pp. 744\u2013753. ACM, New York (2014). https:\/\/doi.org\/10.1145\/2591796.2591840, http:\/\/doi.acm.org\/10.1145\/2591796.2591840","DOI":"10.1145\/2591796.2591840"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-319-59250-3_17","volume-title":"Integer Programming and Combinatorial Optimization","author":"Z Friggstad","year":"2017","unstructured":"Friggstad, Z., Swamy, C.: Compact, provably-good LPs for orienteering and regret-bounded vehicle routing. In: Eisenbrand, F., Koenemann, J. (eds.) IPCO 2017. LNCS, vol. 10328, pp. 199\u2013211. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59250-3_17"},{"issue":"4","key":"9_CR9","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1287\/moor.10.4.527","volume":"10","author":"M Haimovich","year":"1985","unstructured":"Haimovich, M., Rinnooy Kan, A.: Bounds and heuristics for capacitated routing problems. Math. Oper. Res. 10(4), 527\u2013542 (1985)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"9_CR10","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"DS Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems theoretical and practical results. J. ACM (JACM) 34(1), 144\u2013162 (1987)","journal-title":"J. ACM (JACM)"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1023\/A:1018928911513","volume":"69","author":"Y Karuno","year":"1997","unstructured":"Karuno, Y., Nagamochi, H., Ibaraki, T.: Vehicle scheduling on a tree with release and handling times. Ann. Oper. Res. 69, 193\u2013207 (1997)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"9_CR12","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1287\/opre.39.4.616","volume":"39","author":"M Labb\u00e9","year":"1991","unstructured":"Labb\u00e9, M., Laporte, G., Mercure, H.: Capacitated vehicle routing on trees. Oper. Res. 39(4), 616\u2013622 (1991)","journal-title":"Oper. Res."},{"issue":"5","key":"9_CR13","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.ipl.2007.06.012","volume":"104","author":"H Nagamochi","year":"2007","unstructured":"Nagamochi, H., Okada, K.: Approximating the minmax rooted-tree cover in a tree. Inf. Process. Lett. 104(5), 173\u2013178 (2007)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"9_CR14","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1002\/net.20435","volume":"59","author":"V Nagarajan","year":"2012","unstructured":"Nagarajan, V., Ravi, R.: Approximation algorithms for distance constrained vehicle routing problems. Networks 59(2), 209\u2013214 (2012)","journal-title":"Networks"},{"issue":"1","key":"9_CR15","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/321921.321934","volume":"23","author":"SK Sahni","year":"1976","unstructured":"Sahni, S.K.: Algorithms for scheduling independent tasks. J. ACM (JACM) 23(1), 116\u2013127 (1976)","journal-title":"J. ACM (JACM)"},{"issue":"2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.ejor.2012.12.023","volume":"227","author":"L Xu","year":"2013","unstructured":"Xu, L., Xu, Z., Xu, D.: Exact and approximation algorithms for the min-max k-traveling salesmen problem on a tree. Eur. J. Oper. Res. 227(2), 284\u2013292 (2013)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24766-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:53:03Z","timestamp":1710265983000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-24766-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030247652","9783030247669"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24766-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Edmonton, AB","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}