{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T12:15:50Z","timestamp":1781266550307,"version":"3.54.1"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Operations Research"],"published-print":{"date-parts":[[2002,2]]},"DOI":"10.1023\/a:1020711416254","type":"journal-article","created":{"date-parts":[[2003,3,18]],"date-time":"2003-03-18T20:53:36Z","timestamp":1048020816000},"page":"69-82","source":"Crossref","is-referenced-by-count":28,"title":["A Note on the Robust 1-Center Problem on Trees"],"prefix":"10.1007","volume":"110","author":[{"given":"Rainer E.","family":"Burkard","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Helidon","family":"Dollani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"5099489_CR1","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1016\/S0377-2217(99)00257-X","volume":"123","author":"I. Averbakh","year":"2000","unstructured":"I. Averbakh and O. Berman, Algorithms for the robust 1-center problem on a tree, European Journal of Operational Research 123 (2000) 292-302.","journal-title":"European Journal of Operational Research"},{"key":"5099489_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/BFb0028271","volume-title":"Algorithms and Data Structures (Ottawa, ON, 1991)","author":"G.N. Frederickson","year":"1991","unstructured":"G.N. Frederickson, Parametric search and locating supply centers in trees, in: Algorithms and Data Structures (Ottawa, ON, 1991), Lecture Notes in Computer Science 519 (Springer, Berlin, 1991) pp. 299-319."},{"key":"5099489_CR3","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1287\/trsc.7.3.287","volume":"7","author":"G.Y. Handler","year":"1973","unstructured":"G.Y. Handler, Minimax location of a facility in an undirected graph, Transportation Science 7 (1973) 287-293.","journal-title":"Transportation Science"},{"key":"5099489_CR4","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"N. Megiddo, Linear time algorithms for linear programming in \u211d3 and related problems, SIAM J. Comput. 12 (1983) 759-776.","journal-title":"SIAM J. Comput."},{"key":"5099489_CR5","volume-title":"Davenport-Schinzel Sequences and Their Geometric Applications","author":"M. Sharir","year":"1995","unstructured":"M. Sharir and P.K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications (Cambridge Univ. Press, New York, 1995)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020711416254.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1020711416254\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020711416254.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:09:05Z","timestamp":1747577345000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1020711416254"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":5,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["5099489"],"URL":"https:\/\/doi.org\/10.1023\/a:1020711416254","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}