{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:05:46Z","timestamp":1761620746879},"reference-count":26,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"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":4095,"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,5]]},"DOI":"10.1016\/s0166-218x(01)00199-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T07:07:35Z","timestamp":1027580855000},"page":"263-278","source":"Crossref","is-referenced-by-count":35,"title":["The centdian subtree on tree networks"],"prefix":"10.1016","volume":"118","author":[{"given":"Arie","family":"Tamir","sequence":"first","affiliation":[]},{"given":"Justo","family":"Puerto","sequence":"additional","affiliation":[]},{"given":"Dionisio","family":"P\u00e9rez-Brito","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00199-8_BIB1","doi-asserted-by":"crossref","first-page":"1395","DOI":"10.1016\/S0305-0548(99)00042-8","article-title":"Algorithms for path medi-centers of a tree","volume":"26","author":"Averbakh","year":"1999","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00199-8_BIB2","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1057\/jors.1991.69","article-title":"Medi-centre location problems","volume":"42","author":"Berman","year":"1991","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/S0166-218X(01)00199-8_BIB3","first-page":"1","article-title":"An axiomatic approach to the cent-dian criterion","volume":"3","author":"Carrizosa","year":"1994","journal-title":"Location Sci."},{"key":"10.1016\/S0166-218X(01)00199-8_BIB4","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1145\/7531.7537","article-title":"Slowing down sorting networks to obtain faster sorting algorithms","volume":"34","author":"Cole","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(01)00199-8_BIB5","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF02564789","article-title":"Location of paths on trees with minimal eccentricity and superior section","volume":"6","author":"Fern\u00e1ndez","year":"1998","journal-title":"TOP"},{"key":"10.1016\/S0166-218X(01)00199-8_BIB6","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0196-6774(83)90035-4","article-title":"Finding kth paths and p-centers by generating and searching good data structures","volume":"4","author":"Frederickson","year":"1983","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(01)00199-8_BIB7","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1137\/0213002","article-title":"Generalized selection and ranking: sorted matrices","volume":"13","author":"Frederickson","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(01)00199-8_BIB8","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1002\/net.3230230605","article-title":"On locating path- or tree shaped facilities on networks","volume":"23","author":"Hakimi","year":"1993","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(01)00199-8_BIB9","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1111\/j.1467-9787.1976.tb00966.x","article-title":"The location of a cent-dian convex combination on an undirected tree","volume":"16","author":"Halpern","year":"1976","journal-title":"J. Regional Sci."},{"key":"10.1016\/S0166-218X(01)00199-8_BIB10","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1287\/mnsc.24.5.535","article-title":"Finding minimal center-median convex combination (cent-dian) of a graph","volume":"24","author":"Halpern","year":"1978","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(01)00199-8_BIB11","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1287\/trsc.19.3.246","article-title":"Medi-centers of a tree","volume":"19","author":"Handler","year":"1985","journal-title":"Transport. Sci."},{"key":"10.1016\/S0166-218X(01)00199-8_BIB12","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)00199-8_BIB13","unstructured":"M.C. L\u00f3pez De los Mozos, J.A. Mesa Colmenar, Location of cent-dian paths in tree graphs, Proceedings of the VI Meeting of the Euro Working Group on Locational Analysis, 1992, pp. 135\u2013145."},{"key":"10.1016\/S0166-218X(01)00199-8_BIB14","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1137\/0212051","article-title":"New results on the complexity of p-center problems","volume":"12","author":"Megiddo","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(01)00199-8_BIB15","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1137\/0210023","article-title":"An O(nlog2n) 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\/S0166-218X(01)00199-8_BIB16","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)00199-8_BIB17","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0196-6774(83)90015-9","article-title":"On finding the core of a tree with a specified length","volume":"4","author":"Minieka","year":"1983","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(01)00199-8_BIB18","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1016\/S0305-0548(98)00036-7","article-title":"On the sum-max bicriterion path problem","volume":"25","author":"Pelegr\u0131\u0301n","year":"1998","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00199-8_BIB19","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 specified length","volume":"20","author":"Peng","year":"1996","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(01)00199-8_BIB20","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1006\/jagm.1993.1034","article-title":"Algorithms for a core and k-tree core of a tree","volume":"15","author":"Peng","year":"1993","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(01)00199-8_BIB21","first-page":"27","article-title":"The finite dominating set for the p-facility centdian network location problem","volume":"11","author":"P\u00e9rez-Brito","year":"1997","journal-title":"Stud. Location Anal."},{"key":"10.1016\/S0166-218X(01)00199-8_BIB22","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1016\/S0966-8349(98)00057-6","article-title":"The 2-facility centdian network problem","volume":"6","author":"P\u00e9rez-Brito","year":"1998","journal-title":"Location Sci."},{"key":"10.1016\/S0166-218X(01)00199-8_BIB23","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1002\/(SICI)1097-0037(199703)29:2<107::AID-NET4>3.0.CO;2-N","article-title":"The tree center problems and the relationship with the bottleneck knapsack problems","volume":"29","author":"Shioura","year":"1997","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(01)00199-8_BIB24","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0166-218X(98)00059-6","article-title":"Fully polynomial approximation schemes for locating a tree-shaped facility: a generalization of the knapsack problem","volume":"87","author":"Tamir","year":"1998","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00199-8_BIB25","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/net.3230220302","article-title":"The generalized p-forest problem on a tree network","volume":"22","author":"Tamir","year":"1992","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(01)00199-8_BIB26","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1002\/(SICI)1097-0037(199812)32:4<255::AID-NET2>3.0.CO;2-O","article-title":"A polynomial algorithm for the p-centdian problem on a tree","volume":"25","author":"Tamir","year":"1998","journal-title":"Networks"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01001998?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01001998?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:57:20Z","timestamp":1556762240000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01001998"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0166218X01001998"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00199-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}