{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:11:38Z","timestamp":1725495098252},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429852"},{"type":"electronic","value":"9783540456780"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45678-3_63","type":"book-chapter","created":{"date-parts":[[2007,11,15]],"date-time":"2007-11-15T11:12:14Z","timestamp":1195125134000},"page":"743-755","source":"Crossref","is-referenced-by-count":3,"title":["The Cent-dian Path Problem on Tree Networks"],"prefix":"10.1007","author":[{"given":"Ronald I.","family":"Becker","sequence":"first","affiliation":[]},{"given":"Yen-I","family":"Chiang","sequence":"additional","affiliation":[]},{"given":"Isabella","family":"Lari","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"Scozzari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,12,4]]},"reference":[{"key":"63_CR1","doi-asserted-by":"publisher","first-page":"1395","DOI":"10.1016\/S0305-0548(99)00042-8","volume":"26","author":"I. Averbakh","year":"1999","unstructured":"I. Averbakh and O. Berman.: Algorithms for path medi-center of a tree. Computers and Operations Research, 26 (1999) 1395\u20131409.","journal-title":"Computers and Operations Research"},{"key":"63_CR2","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1080\/16073606.1990.9631610","volume":"13","author":"R. I. Becker","year":"1990","unstructured":"R. I. Becker.: Inductive algorithms on finite trees. Quaestiones Mathematicae, 13 (1990) 165\u2013181.","journal-title":"Quaestiones Mathematicae"},{"key":"63_CR3","unstructured":"R. I. Becker, Y. Chiang, I. Lari, A. Scozzari, and G. Storchi.: Finding the \u2113-core of a tree. Quaderni del Di partimento di Statistica, Probabilit\u00e1 e Statistiche Applicate, 15 (1999). To appear, Discrete Applied Mathematics."},{"key":"63_CR4","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1287\/trsc.5.2.212","volume":"5","author":"A. J. Goldman","year":"1971","unstructured":"A. J. Goldman.: Optimum center location in simple networks. Transportation Science, 5 (1971) 212\u2013221.","journal-title":"Transportation Science"},{"key":"63_CR5","first-page":"237","volume":"16","author":"J. Halpern","year":"1976","unstructured":"J. Halpern.: The location of a center-median convex combination on an undirected tree. Journalof RegionalS cience, 16 (1976) 237\u2013245.","journal-title":"Journalof RegionalS cience"},{"key":"63_CR6","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1287\/mnsc.24.5.535","volume":"24","author":"J. Halpern","year":"1978","unstructured":"J. Halpern.: Finding minimal center-median convex combination (cent-dian) of a graph. Management Science, 24 (1978) 534\u2013544.","journal-title":"Management Science"},{"key":"63_CR7","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O. Kariv","year":"1979","unstructured":"O. Kariv and S. L. Hakimi.: An algorithmic approach to network location problems. ii: The p-medians. SIAM journalof Applied Mathematics, 37 (1979) 539\u2013560.","journal-title":"SIAM journalof Applied Mathematics"},{"key":"63_CR8","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1002\/(SICI)1097-0037(199610)28:3<167::AID-NET5>3.0.CO;2-L","volume":"28","author":"T. U. Kim","year":"1996","unstructured":"T. U. Kim, T. J. Lowe, A. Tamir, and J. E. Ward.: On the location of a tree-shaped facility. Networks, 28 (1996) 167\u2013175.","journal-title":"Networks"},{"key":"63_CR9","first-page":"551","volume":"8","author":"M. Labb\u00e9","year":"1995","unstructured":"M. Labb\u00e9, D. Peeters, and J. F. Thisse.: Location on networks. Handbooks in O. R. and M. S., 8 (1995) 551\u2013624.","journal-title":"Handbooks in O. R. and M. S."},{"key":"63_CR10","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0196-6774(80)90012-7","volume":"1","author":"C. A. Morgan","year":"1980","unstructured":"C. A. Morgan and J. P. Slater.: A linear algorithm for a core of a tree. Journal of Algorithms, 1 (1980) 247\u2013258.","journal-title":"Journal of Algorithms"},{"key":"63_CR11","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1006\/jagm.1996.0022","volume":"20","author":"S. Peng","year":"1996","unstructured":"S. Peng and W. Lo.: Efficient algorithms for finding a core of a tree with a specified length. Journal of Algorithms, 20 (1996) 445\u2013458.","journal-title":"Journal of Algorithms"},{"key":"63_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.16.1.1","volume":"16","author":"P. J. Slater","year":"1982","unstructured":"P. J. Slater.: Locating central paths in a network. Transportation Science, 16 (1982) 1\u201318.","journal-title":"Transportation Science"},{"key":"63_CR13","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0167-6377(96)00021-1","volume":"19","author":"A. Tamir","year":"1996","unstructured":"A. Tamir.: An O(pn\n                           2) algorithm for the p-median and related problems on tree graphs. Operation Research Letters, 19 (1996) 59\u201364.","journal-title":"Operation Research Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45678-3_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T10:10:47Z","timestamp":1551089447000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45678-3_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429852","9783540456780"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45678-3_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]}}}