{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T14:10:05Z","timestamp":1737123005110,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439967"},{"type":"electronic","value":"9783540456551"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45655-4_56","type":"book-chapter","created":{"date-parts":[[2007,5,21]],"date-time":"2007-05-21T11:37:01Z","timestamp":1179747421000},"page":"525-534","source":"Crossref","is-referenced-by-count":0,"title":["Minimum Back-Walk-Free Latency Problem"],"prefix":"10.1007","author":[{"given":"Yaw-Ling","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,29]]},"reference":[{"key":"56_CR1","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/0125042","volume":"25","author":"D. Adolphson","year":"1973","unstructured":"D. Adolphson and T. C. Hu. Optimal linear ordering. SI AM J. Appl. Math., 25:403\u2013423, 1973.","journal-title":"SI AM J. Appl. Math."},{"issue":"1","key":"56_CR2","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1051\/ita\/1986200100791","volume":"20","author":"F. Afrati","year":"1986","unstructured":"F. Afrati, S. Cosmadakis, C. Papadimitriou, G. Papageorgiou, and N. Pa-pakostantino. The complexity of the traveling repairman problem. Informatique Theorique et Applications (Theoretical Informatics and Applications), 20(1):79\u201387, 1986.","journal-title":"Informatique Theorique et Applications (Theoretical Informatics and Applications)"},{"key":"56_CR3","doi-asserted-by":"crossref","unstructured":"A. Blum, P. Chalasani, D. Coppersmith, B. Pulleyblank, P. Raghavan, and M. Sudan. The minimum latency problem. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 163\u2013171, Montr\u00e9al, Qu\u00e9bec, Canada, 23\u201325 May 1994.","DOI":"10.1145\/195058.195125"},{"key":"56_CR4","unstructured":"T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. MIT Press, 1990."},{"key":"56_CR5","volume-title":"Computers and Intractability-A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson. Computers and Intractability-A Guide to the Theory of NP-Completeness. Freeman, New York, 1979."},{"key":"56_CR6","doi-asserted-by":"crossref","unstructured":"T. Imielinski, S. Viswanathan, and B.R. Badrinath. Power efficient filtering of data on air. 4th International Conference on Extending Database Technoloy, pages 245\u2013258, March 1994.","DOI":"10.1007\/3-540-57818-8_55"},{"issue":"3","key":"56_CR7","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1109\/69.599926","volume":"9","author":"T. Imielinski","year":"1997","unstructured":"T. Imielinski, S. Viswanathan, and B.R. Badrinath. Data on air: Organization and access. IEEE Trans. on Knowledge and Data Engineering, 9(3):353\u2013372, May 1997.","journal-title":"IEEE Trans. on Knowledge and Data Engineering"},{"key":"56_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/3-540-61440-0_135","volume-title":"Proc. 23rd Colloquium on Automata, Languages and Programming","author":"E. Koutsoupias","year":"1996","unstructured":"E. Koutsoupias, C. Papadimitriou, and M. Yannakakis. Searching a fixed graph. In Proc. 23rd Colloquium on Automata, Languages and Programming, LNCS 1099, pages 280\u2013289. Springer-Verlag, 1996."},{"key":"56_CR9","doi-asserted-by":"crossref","unstructured":"Shou-Chih Lo and Arbee L.P. Chen. Index and data allocation in multiple broadcast channels. IEEE Interantion Conference on Data Engineering 2000, pages 293\u2013302, 2000.","DOI":"10.1109\/ICDE.2000.839421"},{"issue":"1\u20134","key":"56_CR10","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02097807","volume":"18","author":"E. Minieka","year":"1989","unstructured":"E. Minieka. The delivery man problem on a tree network. Annals of Operations Research, 18(1\u20134):261\u2013266, February 1989.","journal-title":"Annals of Operations Research"},{"key":"56_CR11","unstructured":"N. Shivakumar and S. Venkatasubramanian. Energy-efficient indexing for information dissemination in wireless systems. ACM, Journal of Wireless and Nomadic Application, 1996."},{"key":"56_CR12","doi-asserted-by":"crossref","unstructured":"Tsitsiklis. Special cases of traveling salesman and repairman problems with time windows. NETWORKS: Networks: An International Journal, 22, 1992.","DOI":"10.1002\/net.3230220305"},{"issue":"5","key":"56_CR13","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0020-0190(00)00102-2","volume":"75","author":"Bang-Ye Wu","year":"2000","unstructured":"Bang-Ye Wu. Polynomial time algorithms for some minimum latency problems. Information Processing Letters, 75(5):225\u2013229, October 2000.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45655-4_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T14:32:19Z","timestamp":1737037939000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45655-4_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439967","9783540456551"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45655-4_56","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}