{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:48:47Z","timestamp":1774421327295,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540327554","type":"print"},{"value":"9783540327561","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11682462_19","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T06:50:30Z","timestamp":1140159030000},"page":"166-177","source":"Crossref","is-referenced-by-count":11,"title":["An Optimal Algorithm for the Continuous\/Discrete Weighted 2-Center Problem in Trees"],"prefix":"10.1007","author":[{"given":"Boaz","family":"Ben-Moshe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binay","family":"Bhattacharya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiaosheng","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1145\/7531.7537","volume":"34","author":"R. Cole","year":"1987","unstructured":"Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. J. ACM\u00a034, 200\u2013208 (1987)","journal-title":"J. ACM"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Frederickson, G.N.: Parametric search and locating supply centers in trees. In: WADS, pp. 299\u2013319 (1991)","DOI":"10.1007\/BFb0028271"},{"key":"19_CR3","unstructured":"Halman, N.: Discrete and lexicographic helly theorems and their relations to LPtype problems., Ph.D. Thesis, Tel Aviv Univ. (2004)"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O. Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems, Part I. The p-centers. SIAM J. Appl. Math.\u00a037, 513\u2013538 (1979)","journal-title":"SIAM J. Appl. Math."},{"issue":"4","key":"19_CR5","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N.: Linear-time algorithms for linear programming in R3 and related problems. SIAM J. Comput.\u00a012(4), 759\u2013776 (1983)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"19_CR6","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1137\/0210023","volume":"10","author":"N. Megiddo","year":"1981","unstructured":"Megiddo, N., Tamir, A., Zemel, E., Chandrasekaran, R.: An O(n log 2n) algorithm for the kth longest path in a tree with applications to location problems. SIAM J. Comput.\u00a010(2), 328\u2013337 (1981)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"19_CR7","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1137\/0212051","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N., Tamir, A.: New results on the complexity of p-center problems. SIAM J. Comput.\u00a012(4), 751\u2013758 (1983)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T03:03:12Z","timestamp":1552359792000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/11682462_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}