{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T09:41:56Z","timestamp":1746438116283},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175138"},{"type":"electronic","value":"9783642175145"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17514-5_17","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T15:09:23Z","timestamp":1291388963000},"page":"192-205","source":"Crossref","is-referenced-by-count":11,"title":["Approximation Algorithms for the Multi-Vehicle Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Binay","family":"Bhattacharya","sequence":"first","affiliation":[]},{"given":"Yuzhuang","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2-3","key":"17_CR1","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.tcs.2004.05.013","volume":"324","author":"J.E. Augustine","year":"2004","unstructured":"Augustine, J.E., Seiden, S.: Linear time approximation schemes for vehicle scheduling problems. Theoretical Computer Science\u00a0324(2-3), 147\u2013160 (2004)","journal-title":"Theoretical Computer Science"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Bansal, N., Blum, A., Chawla, S., Meyerson, A.: Approximation algorithms for deadline-TSP and vehicle routing with time-windows. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pp. 166\u2013174 (2004)","DOI":"10.1145\/1007352.1007385"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Bar-Yehuda, R., Even, G., Shahar, S.: On approximating a geometric prize-collecting traveling salesman problem with time windows. In: Proceedings of the 11th Annual European Symposium on Algorithms, pp. 55\u201366 (2003)","DOI":"10.1007\/978-3-540-39658-1_8"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Bhattacharya, B.K., Carmi, P., Hu, Y., Shi, Q.: Single Vehicle Scheduling Problems on Path\/Tree\/Cycle Networks with Release and Handling Times. In: Proceedings of the 19th International Symposium on Algorithms and Computation, pp. 800\u2013811 (2008)","DOI":"10.1007\/978-3-540-92182-0_70"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"G.B. Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, R.H.: The truck dispatching problem. Management Science\u00a06, 80\u201391 (1959)","journal-title":"Management Science"},{"issue":"4","key":"17_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., Konemann, J., Ravi, R., Sinha, A.: Min-max tree covers of graphs. Operations Research Letters\u00a032(4), 309\u2013315 (2004)","journal-title":"Operations Research Letters"},{"issue":"4","key":"17_CR7","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1002\/net.10028","volume":"39","author":"Y. Karuno","year":"2002","unstructured":"Karuno, Y., Nagamochi, H.: Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks. Networks\u00a039(4), 203\u2013209 (2002)","journal-title":"Networks"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Karuno, Y., Nagamochi, H.: A polynomial time approximation scheme for the multi-vehicle scheduling problem on a path with release and handling times. In: Proceedings of the 12th International Symposium on Algorithms and Computation, pp. 36\u201347 (2001)","DOI":"10.1007\/3-540-45678-3_4"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Karuno, Y., Nagamochi, H.: A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times. In: Proceedings of the 9th Annual European Symposium on Algorithms, pp. 218\u2013229 (2001)","DOI":"10.1007\/3-540-44676-1_18"},{"key":"17_CR10","unstructured":"Korula, N., Chekuri, C.: Approximation algorithms for orienteering with timewindows (September 2007) (manuscript)"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/moor.4.4.414","volume":"4","author":"N. Megiddo","year":"1979","unstructured":"Megiddo, N.: Combinatorial optimization with rational objective functions. Math. Oper. Res.\u00a04, 414\u2013424 (1979)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"17_CR12","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N.: Applying parallel computation algorithms in the design of serial algorithms. Journal of ACM\u00a030(4), 852\u2013865 (1983)","journal-title":"Journal of ACM"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Menger, K.: Reminiscences of the vienna circle and the mathematical colloquium. Dortmund (1994)","DOI":"10.1007\/978-94-011-1102-7"},{"issue":"4","key":"17_CR14","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1080\/03155986.1997.11732334","volume":"35","author":"H. Nagamochi","year":"1997","unstructured":"Nagamochi, H., Mochizuki, K., Ibaraki, T.: Complexity of the Single Vehicle Scheduling Problem on Graphs. Inform. Systems Oper. Res.\u00a035(4), 256\u2013276 (1997)","journal-title":"Inform. Systems Oper. Res."},{"issue":"1-3","key":"17_CR15","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.dam.2003.06.001","volume":"140","author":"H. Nagamochi","year":"2004","unstructured":"Nagamochi, H., Okada, K.: A faster 2-approximationalgorithm for the minmax p-traveling salesmenproblem on a tree. Discrete Applied Mathematics\u00a0140(1-3), 103\u2013114 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-540-24587-2_16","volume-title":"Algorithms and Computation","author":"H. Nagamochi","year":"2003","unstructured":"Nagamochi, H., Okada, K.: Polynomial time 2-approximation algorithms for the minmax subtree cover problem. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol.\u00a02906, pp. 138\u2013147. Springer, Heidelberg (2003)"},{"key":"17_CR17","series-title":"SIAM Monographs on Discrete Mathematics and Applications","volume-title":"The vehicle routing problem","year":"2002","unstructured":"Toth, P., Vigo, D. (eds.): The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications, vol.\u00a09. SIAM, Phaladelphia (2002)"}],"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-17514-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T12:57:22Z","timestamp":1553259442000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17514-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175138","9783642175145"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17514-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}