{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T09:01:38Z","timestamp":1768986098799,"version":"3.49.0"},"reference-count":10,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1995,1]]},"DOI":"10.1016\/0020-0190(94)00183-y","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:04:31Z","timestamp":1027649071000},"page":"109-111","source":"Crossref","is-referenced-by-count":80,"title":["On the minimum diameter spanning tree problem"],"prefix":"10.1016","volume":"53","author":[{"given":"Refael","family":"Hassin","sequence":"first","affiliation":[]},{"given":"Arie","family":"Tamir","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00183-Y_bib1","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0166-218X(84)90004-0","article-title":"The absolute center of a graph","volume":"7","author":"Cunninghame-Greene","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(94)00183-Y_bib2","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1145\/28869.28874","article-title":"Fibonacci heaps and their uses in improved network optimization algorithms","volume":"34","author":"Fredman","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(94)00183-Y_bib3","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.12.3.450","article-title":"Optimal locations of switching centers and medians of a graph","volume":"12","author":"Hakimi","year":"1964","journal-title":"Oper. Res."},{"key":"10.1016\/0020-0190(94)00183-Y_bib4","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1287\/trsc.7.3.287","article-title":"Minimax location of a facility in an undirected tree graph","volume":"7","author":"Handler","year":"1973","journal-title":"Transportation Sci."},{"key":"10.1016\/0020-0190(94)00183-Y_bib5","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1137\/0220060","article-title":"Minimum diameter spanning trees and related problems","volume":"20","author":"Ho","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)00183-Y_bib6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.12.1.1","article-title":"On p-centers in networks","volume":"12","author":"Hakimi","year":"1978","journal-title":"Transportation Sci."},{"key":"10.1016\/0020-0190(94)00183-Y_bib7","series-title":"Computational Geometry \u2014 Methods, Algorithms and Applications","first-page":"103","article-title":"On shortest networks for classes of points in the plane","volume":"551","author":"Ihler","year":"1991"},{"key":"10.1016\/0020-0190(94)00183-Y_bib8","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\/0020-0190(94)00183-Y_bib9","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1287\/opre.25.4.641","article-title":"The centers and medians of a graph","volume":"25","author":"Minieka","year":"1977","journal-title":"Oper. Res."},{"key":"10.1016\/0020-0190(94)00183-Y_bib10","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1137\/0401038","article-title":"Improved complexity bounds for center location problems on networks by using dynamic data structures","volume":"1","author":"Tamir","year":"1988","journal-title":"SIAM J. Discrete Math."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909400183Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909400183Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T02:58:00Z","timestamp":1555297080000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909400183Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["002001909400183Y"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00183-y","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}