{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,3]],"date-time":"2026-08-03T06:34:17Z","timestamp":1785738857287,"version":"3.56.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540212584","type":"print"},{"value":"9783540246985","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24698-5_46","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T22:28:22Z","timestamp":1294439302000},"page":"423-433","source":"Crossref","is-referenced-by-count":7,"title":["Minimum Latency Tours and the k-Traveling Repairmen Problem"],"prefix":"10.1007","author":[{"given":"Raja","family":"Jothi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Balaji","family":"Raghavachari","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"46_CR1","unstructured":"Archer, A., Levin, A., Williamson, D.P.: Faster approximation algorithms for the minimum latency problem. In: SODA 2003 (2003)"},{"key":"46_CR2","unstructured":"Arora, S., Karakostas, G.: A 2+epsilon approximation for the k-MST problem. In: SODA 2000 (2000)"},{"key":"46_CR3","doi-asserted-by":"crossref","unstructured":"Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, B., Raghavan, P., Sudan, M.: The minimum latency problem. In: SODA 1994 (1994)","DOI":"10.1145\/195058.195125"},{"key":"46_CR4","doi-asserted-by":"crossref","unstructured":"Chaudhuri, K., Godfrey, B., Rao, S., Talwar, K.: Paths, tours, and minimum latency tours. In: FOCS 2003 (2003)","DOI":"10.1109\/SFCS.2003.1238179"},{"key":"46_CR5","unstructured":"Chekuri, C., Kumar, A.: A note on the k-traveling repairmen problem (manuscript, 2003)"},{"key":"46_CR6","unstructured":"Fakcharoenphol, J., Harrelson, C., Rao, S.: The k-traveling repairman problem. In: SODA 2003 (2003)"},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"Garg, N.: A 3-approximation for the minimum tree spanning k vertices. In: FOCS 1996 (1996)","DOI":"10.1109\/SFCS.1996.548489"},{"key":"46_CR8","unstructured":"Goemans, M., Kleinberg, J.: An improved approximation ratio for the minimum latency problem. In: SODA 1996 (1996)"},{"key":"46_CR9","unstructured":"Gubbala, P., Pursnani, H.: Personal communication (November 2003)"},{"issue":"3","key":"46_CR10","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sahni, S., Gonzales, T.: P-complete approximation problems. JACM\u00a023(3), 555\u2013565 (1976)","journal-title":"JACM"},{"key":"46_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-47867-1_17","volume-title":"Integer Programming and Combinatorial Optimization","author":"R. Sitters","year":"2002","unstructured":"Sitters, R.: The minimum latency problem is NP-hard for weighted trees. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol.\u00a02337, p. 230. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2004: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24698-5_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T11:46:17Z","timestamp":1553341577000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24698-5_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212584","9783540246985"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24698-5_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}