{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:50:04Z","timestamp":1759063804329},"reference-count":11,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4125,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1016\/s0166-218x(01)00254-2","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T11:12:20Z","timestamp":1034593940000},"page":"25-42","source":"Crossref","is-referenced-by-count":17,"title":["Finding the \u2113-core of a tree"],"prefix":"10.1016","volume":"118","author":[{"given":"Ronald I.","family":"Becker","sequence":"first","affiliation":[]},{"given":"Yen I.","family":"Chang","sequence":"additional","affiliation":[]},{"given":"Isabella","family":"Lari","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"Scozzari","sequence":"additional","affiliation":[]},{"given":"Giovanni","family":"Storchi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00254-2_BIB1","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1080\/16073606.1990.9631610","article-title":"Inductive algorithms on finite trees","volume":"13","author":"Becker","year":"1990","journal-title":"Quaestiones Math."},{"key":"10.1016\/S0166-218X(01)00254-2_BIB2","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1287\/trsc.5.2.212","article-title":"Optimum center location in simple networks","volume":"5","author":"Goldman","year":"1971","journal-title":"Transportation Sci."},{"key":"10.1016\/S0166-218X(01)00254-2_BIB3","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1002\/net.3230230605","article-title":"On locating path or tree shaped facilities on network","volume":"23","author":"Hakimi","year":"1993","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(01)00254-2_BIB4","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."},{"key":"10.1016\/S0166-218X(01)00254-2_BIB5","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","article-title":"An algorithmic approach to network location problems. II: The p-medians","volume":"37","author":"Kariv","year":"1979","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0166-218X(01)00254-2_BIB6","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/(SICI)1097-0037(199610)28:3<167::AID-NET5>3.0.CO;2-L","article-title":"On the location of a tree-shaped facility","volume":"28","author":"Kim","year":"1996","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(01)00254-2_BIB7","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/net.3230150304","article-title":"The optimal location of a path or tree in a tree network","volume":"15","author":"Minieka","year":"1985","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(01)00254-2_BIB8","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0196-6774(80)90012-7","article-title":"A linear algorithm for a core of a tree","volume":"1","author":"Morgan","year":"1980","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(01)00254-2_BIB9","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\/S0166-218X(01)00254-2_BIB10","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1002\/net.3230200404","article-title":"Optimal location of a path or tree on a network with cycles","volume":"20","author":"Richey","year":"1990","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(01)00254-2_BIB11","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0167-6377(96)00021-1","article-title":"An O(pn2) algorithm for the p-median and related problems on tree graphs","volume":"19","author":"Tamir","year":"1996","journal-title":"Oper. Res. Lett."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002542?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002542?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T01:29:53Z","timestamp":1556760593000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01002542"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":11,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0166218X01002542"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00254-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}