{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T01:22:54Z","timestamp":1773796974551,"version":"3.50.1"},"reference-count":36,"publisher":"IEEE Computer. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sfcs.2003.1238179","type":"proceedings-article","created":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T21:26:50Z","timestamp":1078176410000},"page":"36-45","source":"Crossref","is-referenced-by-count":73,"title":["Paths, trees, and minimum latency tours"],"prefix":"10.1109","author":[{"given":"K.","family":"Chaudhuri","sequence":"first","affiliation":[]},{"given":"B.","family":"Godfrey","sequence":"additional","affiliation":[]},{"given":"S.","family":"Rao","sequence":"additional","affiliation":[]},{"given":"K.","family":"Talwar","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45471-3_20"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00102-2"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1287\/opre.41.6.1055"},{"key":"36","first-page":"192","article-title":"A dynamic programming algorithm for the travelling repairman problem","volume":"6","author":"yang","year":"1989","journal-title":"Asia-Pacific Journal of the Operational Research"},{"key":"18","first-page":"190","article-title":"The dynamic vertex minimum problem and its application to clustering-type approximation algorithms","author":"gabow","year":"2002","journal-title":"Proceedings 8th Scandinavian Workshop on Algorithm Theory (SWAT'02) LNCS"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.29.2.167"},{"key":"15","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/3-540-45753-4_10","article-title":"Approximating minsum set cover","volume":"2462","author":"feige","year":"2002","journal-title":"Lecture Notes in Computer Science Proceedings of the 5th APPROX"},{"key":"34","article-title":"Extremal results and algorithms for degree sequences of graphs","author":"will","year":"1993"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00261-9"},{"key":"13","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45535-3_5","article-title":"Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation","volume":"2081","author":"chudak","year":"2001","journal-title":"Lecture Notes in Computer Science"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/1290672.1290677"},{"key":"11","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1145\/237814.237992","article-title":"A constant-factor approximation algorithm for the k-MST problem","author":"blum","year":"1996","journal-title":"Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing (STOC '96)"},{"key":"12","article-title":"Maximum coverage problem with group budget constraints and applications","author":"chekuri","year":"2003"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585867"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1996.548489"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793242618"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61440-0_135"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44683-4_43"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230200605"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1007\/BF02097807"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1287\/moor.18.1.1"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1974.22"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1080\/07408179108963858"},{"key":"3","article-title":"Faster approximation algorithms for the minimum latency problem","author":"archer","year":"2003"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1080\/07408178808966173"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238180"},{"key":"1","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1051\/ita\/1986200100791","article-title":"The complexity of the traveling repairman problem","volume":"20","author":"afrati","year":"1986","journal-title":"Theoretical Informatics and Applications"},{"key":"30","article-title":"The minimum latency problem in NP-hard for weighted trees","author":"sitter","year":"0","journal-title":"IPCO 9th Integer Programming and Combinatorial Optimization Conference 2002"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230250204"},{"key":"6","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-46521-9_1","article-title":"On salesmen, repairmen, spiders, and other traveling agents","volume":"1767","author":"ausiello","year":"2000","journal-title":"Lecture Notes in Computer Science"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.30.2.134"},{"key":"5","first-page":"754","article-title":"A (2 + ?) approximation algorithm for the k-MST problem","author":"arora","year":"2000","journal-title":"Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230220305"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301432"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195125"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230230202"}],"event":{"name":"44th Annual IEEE Symposium on Foundations of Computer Science - FOCS 2003","location":"Cambridge, MA, USA","acronym":"SFCS-03"},"container-title":["44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8767\/27770\/01238179.pdf?arnumber=1238179","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,4,21]],"date-time":"2018-04-21T10:23:05Z","timestamp":1524306185000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1238179\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/sfcs.2003.1238179","relation":{},"subject":[]}}