{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:47Z","timestamp":1740122387259,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,5,13]],"date-time":"2022-05-13T00:00:00Z","timestamp":1652400000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,13]],"date-time":"2022-05-13T00:00:00Z","timestamp":1652400000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["51979249","62002255"],"award-info":[{"award-number":["51979249","62002255"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Science and Technology Innovation Project for Colleges and Universities in Shanxi Province","award":["2019L0353"],"award-info":[{"award-number":["2019L0353"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10878-022-00866-x","type":"journal-article","created":{"date-parts":[[2022,5,13]],"date-time":"2022-05-13T08:03:59Z","timestamp":1652429039000},"page":"905-920","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4353-5385","authenticated-orcid":false,"given":"Wei","family":"Ding","sequence":"first","affiliation":[]},{"given":"Ke","family":"Qiu","sequence":"additional","affiliation":[]},{"given":"Yu","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Zhou","family":"Ye","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,13]]},"reference":[{"key":"866_CR1","doi-asserted-by":"publisher","first-page":"3463","DOI":"10.1016\/j.aej.2020.05.026","volume":"59","author":"AW Aboutahoun","year":"2020","unstructured":"Aboutahoun AW, EI-Safty F (2020) Optimal algorithms for weighted $$1$$-center problem in deterministic and stochastic tree networks. Alex Eng J 59:3463\u20133471","journal-title":"Alex Eng J"},{"issue":"4","key":"866_CR2","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1007\/s10878-012-9591-7","volume":"28","author":"W Ding","year":"2014","unstructured":"Ding W, Qiu K (2014) Algorithms for the minimum diameter terminal steiner tree problem. J Comb Optim 28(4):837\u2013853","journal-title":"J Comb Optim"},{"key":"866_CR3","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1007\/s10878-017-0130-4","volume":"34","author":"W Ding","year":"2017","unstructured":"Ding W, Qiu K (2017) An FPTAS for generalized absolute $$1$$-center problem in vertex-weighted graphs. J Comb Optim 34:1084\u20131095","journal-title":"J Comb Optim"},{"key":"866_CR4","doi-asserted-by":"crossref","unstructured":"Ding W, Qiu K (2019) Sifting edges to accelerate the computation of absolute $$1$$-center in graphs. In: Proceedings of WCGO 2019, pp 468\u2013476","DOI":"10.1007\/978-3-030-21803-4_47"},{"key":"866_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7572-0","volume-title":"Foundations of location analysis","author":"HA Eiselt","year":"2011","unstructured":"Eiselt HA, Marianov V (2011) Foundations of location analysis. Springer, Heidelberg"},{"issue":"3","key":"866_CR6","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman ML, Tarjan RE (1987) Fibonacci heaps and their uses in improved network optimization algorithms. J ACM 34(3):596\u2013615","journal-title":"J ACM"},{"issue":"4","key":"866_CR7","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1287\/trsc.6.4.407","volume":"6","author":"AJ Goldman","year":"1972","unstructured":"Goldman AJ (1972) Minimax location of a facility in a network. Transp Sci 6(4):407\u2013418","journal-title":"Transp Sci"},{"issue":"3","key":"866_CR8","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1287\/opre.12.3.450","volume":"12","author":"SL Hakimi","year":"1964","unstructured":"Hakimi SL (1964) Optimum locations of switching centers and the absolute centers and medians of a graph. Oper Res 12(3):450\u2013459","journal-title":"Oper Res"},{"issue":"1","key":"866_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.12.1.1","volume":"12","author":"SL Hakimi","year":"1978","unstructured":"Hakimi SL, Schmeichel EF, Pierce JG (1978) On $$p$$-centers in networks. Transp Sci 12(1):1\u201315","journal-title":"Transp Sci"},{"issue":"3","key":"866_CR10","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1287\/trsc.7.3.287","volume":"7","author":"GY Handler","year":"1973","unstructured":"Handler GY (1973) Minimax location of a facility in an undirected tree graph. Transp. Sci. 7(3):287\u2013293","journal-title":"Transp. Sci."},{"issue":"2","key":"866_CR11","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0020-0190(94)00183-Y","volume":"53","author":"R Hassin","year":"1995","unstructured":"Hassin R, Tamir A (1995) On the minimum diameter spanning tree problem. Info Proc Lett 53(2):109\u2013111","journal-title":"Info Proc Lett"},{"issue":"6","key":"866_CR12","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1137\/0222071","volume":"22","author":"DR Karger","year":"1993","unstructured":"Karger DR, Koller D, Phillips SJ (1993) Finding the hidden path: time bounds for all-pairs shortest paths. SIAM J Comput 22(6):1199\u20131217","journal-title":"SIAM J Comput"},{"issue":"3","key":"866_CR13","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems. I: the $$p$$-centers. SIAM J Appl Math 37(3):513\u2013538","journal-title":"SIAM J Appl Math"},{"issue":"1","key":"866_CR14","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0304-3975(03)00402-X","volume":"312","author":"S Pettie","year":"2004","unstructured":"Pettie S (2004) A new approach to all-pairs shortest paths on real-weighted graphs. Theor Comp Sci 312(1):47\u201374","journal-title":"Theor Comp Sci"},{"issue":"3","key":"866_CR15","first-page":"419","volume":"7","author":"J Santiv\u00e1\u00f1ez","year":"2007","unstructured":"Santiv\u00e1\u00f1ez J, Melachrinoudis E (2007) Location of a reliable center on a tree network. Oper Res 7(3):419\u2013445","journal-title":"Oper Res"},{"issue":"5","key":"866_CR16","doi-asserted-by":"publisher","first-page":"1437","DOI":"10.1016\/j.cor.2008.02.007","volume":"36","author":"J Santiv\u00e1\u00f1ez","year":"2009","unstructured":"Santiv\u00e1\u00f1ez J, Melachrinoudis E, Helander ME (2009) Network location of a reliable center using the most reliable route policy. Comput Oper Res 36(5):1437\u20131460","journal-title":"Comput Oper Res"},{"issue":"4","key":"866_CR17","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1287\/mnsc.29.4.482","volume":"29","author":"BC Tansel","year":"1983","unstructured":"Tansel BC, Francis RL, Lowe TJ (1983) Location on networks: a survey. Part I: the $$p$$-center and $$p$$-median problems. Manag Sci 29(4):482\u2013497","journal-title":"Manag Sci"},{"key":"866_CR18","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1002\/(SICI)1097-0037(199708)30:1<37::AID-NET5>3.0.CO;2-M","volume":"30","author":"G Xue","year":"1997","unstructured":"Xue G (1997) Linear time algorithms for computing the most reliable source on an unreliable tree network. Networks 30:37\u201345","journal-title":"Networks"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00866-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00866-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00866-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T06:13:05Z","timestamp":1660371185000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00866-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,13]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["866"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00866-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2022,5,13]]},"assertion":[{"value":"21 April 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}