{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T09:58:56Z","timestamp":1760954336752},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1016\/s0020-0190(98)00194-x","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:25:26Z","timestamp":1049721926000},"page":"63-67","source":"Crossref","is-referenced-by-count":22,"title":["An efficient algorithm for the length-constrained heaviest path problem on a tree"],"prefix":"10.1016","volume":"69","author":[{"given":"Bang Ye","family":"Wu","sequence":"first","affiliation":[]},{"given":"Chao","family":"Kun-Mao","sequence":"additional","affiliation":[]},{"given":"Chuan Yi","family":"Tang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00194-X_BIB1","series-title":"Introduction to Algorithms","author":"Coremen","year":"1994"},{"key":"10.1016\/S0020-0190(98)00194-X_BIB2","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1287\/trsc.5.2.212","article-title":"Optimal center location in simple networks","volume":"5","author":"Goldman","year":"1971","journal-title":"Transportation Sci."},{"key":"10.1016\/S0020-0190(98)00194-X_BIB3","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/0137040","article-title":"An algorithmic approach to network location problems. I: The p-centers","volume":"37","author":"Kariv","year":"1979","journal-title":"SIAM J. Appl. Math."},{"issue":"2","key":"10.1016\/S0020-0190(98)00194-X_BIB4","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1137\/0210023","article-title":"An O(n log2 n) algorithm for the kth longest path in a tree with applications to location problems","volume":"10","author":"Megiddo","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(98)00194-X_BIB5","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1006\/jagm.1996.0022","article-title":"Efficient algorithms for finding a core of a tree with a specified length","volume":"20","author":"Peng","year":"1996","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(98)00194-X_BIB6","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/S0020-0190(97)00109-9","article-title":"An O(n) algorithm for finding an optimal position with relative distances in an evolutionary tree","volume":"63","author":"Wu","year":"1997","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001909800194X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001909800194X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T12:55:09Z","timestamp":1556628909000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002001909800194X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S002001909800194X"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00194-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}