{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T00:44:39Z","timestamp":1792111479134,"version":"4.4.0"},"publisher-location":"New York, NY","reference-count":9,"publisher":"Springer New York","isbn-type":[{"value":"9781493928637","type":"print"},{"value":"9781493928644","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_540","type":"book-chapter","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T20:04:14Z","timestamp":1461269054000},"page":"1481-1484","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Orienteering Problems"],"prefix":"10.1007","author":[{"given":"Nitish","family":"Korula","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"540_CR15225","first-page":"307","volume-title":"Resource-constrained geometric network optimization","author":"E Arkin","year":"1998","unstructured":"Arkin E, Mitchell J, Narasimhan G (1998) Resource-constrained geometric network optimization. In: Symposium on computational geometry, Minneapolis, pp\u00a0307\u2013316"},{"key":"540_CR15226","first-page":"166","volume-title":"Proceedings of the 36th annual ACM symposium on theory of computing","author":"N Bansal","year":"2004","unstructured":"Bansal N, Blum A, Chawla S, Meyerson A (2004) Approximation algorithms for deadline-TSP and vehicle routing with time-windows. In: Proceedings of the 36th annual ACM symposium on theory of computing, Chicago. ACM, New York, pp\u00a0166\u2013174"},{"issue":"2","key":"540_CR15227","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, Lane T, Meyerson A, Minkoff M (2007) Approximation algorithms for orienteering and discounted-reward TSP. SIAM J Comput 37(2):653\u2013670","journal-title":"SIAM J Comput"},{"key":"540_CR15228","first-page":"36","volume-title":"44th annual symposium on foundations of computer science","author":"K Chaudhuri","year":"2003","unstructured":"Chaudhuri K, Godfrey B, Rao S, Talwar K (2003) Paths, trees, and minimum latency tours. In: 44th annual symposium on foundations of computer science, Cambridge. IEEE Computer Society, pp\u00a036\u201345"},{"key":"540_CR15229","first-page":"245","volume-title":"Proceedings of the 46th annual symposium on foundations of computer science","author":"C Chekuri","year":"2005","unstructured":"Chekuri C, P\u00e1l M (2005) A recursive greedy algorithm for walks in directed graphs. In: Proceedings of the 46th annual symposium on foundations of computer science, Pittsburgh. IEEE Computer Society, pp\u00a0245\u2013253"},{"issue":"3","key":"540_CR15230","first-page":"23","volume":"8","author":"C Chekuri","year":"2012","unstructured":"Chekuri C, Korula N, P\u00e1l M (2012) Improved algorithms for orienteering and related problems. ACM Trans Algorithms (TALG) 8(3):23","journal-title":"ACM Trans Algorithms (TALG)"},{"key":"540_CR15231","doi-asserted-by":"crossref","unstructured":"Chen K, Har-Peled S (2008) The orienteering problem in the plane revisited. SIAM J Comput 38(1):385\u2013397, preliminary version in Proceedings of the ACM SoCG, Sedona, 2006, pp\u00a0247\u2013254","DOI":"10.1137\/060667839"},{"issue":"4","key":"540_CR15232","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1007\/s00453-011-9509-2","volume":"60","author":"V Nagarajan","year":"2011","unstructured":"Nagarajan V, Ravi R (2011) The directed orienteering problem. Algorithmica 60(4):1017\u20131030","journal-title":"Algorithmica"},{"key":"540_CR15233","volume-title":"The vehicle routing problem","year":"2001","unstructured":"Toth P, Vigo D (eds) (2001) The vehicle routing problem. SIAM monographs on discrete mathematics and applications. Society for Industrial and Applied Mathematics, Philadelphia"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_540","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T23:54:59Z","timestamp":1792108499000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4939-2864-4_540"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_540","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}