{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:08:28Z","timestamp":1742926108694,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030218027"},{"type":"electronic","value":"9783030218034"}],"license":[{"start":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T00:00:00Z","timestamp":1560556800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-21803-4_47","type":"book-chapter","created":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T22:03:24Z","timestamp":1560549804000},"page":"468-476","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Sifting Edges to Accelerate the Computation of Absolute 1-Center in\u00a0Graphs"],"prefix":"10.1007","author":[{"given":"Wei","family":"Ding","sequence":"first","affiliation":[]},{"given":"Ke","family":"Qiu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,15]]},"reference":[{"key":"47_CR1","unstructured":"Ding, W., Qiu, K.: Algorithms for the minimum diameter terminal steiner tree problem. J. Comb. Optim. 28(4), 837\u2013853 (2014)"},{"key":"47_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-7572-0","volume-title":"Foundations of Location Analysis","author":"HA Eiselt","year":"2011","unstructured":"Eiselt, H.A., Marianov, V.: Foundations of Location Analysis. Springer, Heidelberg (2011)"},{"issue":"3","key":"47_CR3","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3), 596\u2013615 (1987)","journal-title":"J. ACM"},{"issue":"3","key":"47_CR4","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.12.3.450","volume":"12","author":"SL Hakimi","year":"1964","unstructured":"Hakimi, S.L.: Optimum locations of switching centers and the absolute centers and medians of a graph. Oper. Res. 12(3), 450\u2013459 (1964)","journal-title":"Oper. Res."},{"issue":"1","key":"47_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.12.1.1","volume":"12","author":"SL Hakimi","year":"1978","unstructured":"Hakimi, S.L., Schmeichel, E.F., Pierce, J.G.: On \n                    \n                      \n                    \n                    $$p$$\n                  -centers in networks. Transport. Sci. 12(1), 1\u201315 (1978)","journal-title":"Transport. Sci."},{"issue":"2","key":"47_CR6","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0020-0190(94)00183-Y","volume":"53","author":"R Hassin","year":"1995","unstructured":"Hassin, R., Tamir, A.: On the minimum diameter spanning tree problem. Info. Proc. Lett. 53(2), 109\u2013111 (1995)","journal-title":"Info. Proc. Lett."},{"issue":"6","key":"47_CR7","doi-asserted-by":"crossref","first-page":"1199","DOI":"10.1137\/0222071","volume":"22","author":"DR Karger","year":"1993","unstructured":"Karger, D.R., Koller, D., Phillips, S.J.: Finding the hidden path: time bounds for all-pairs shortest paths. SIAM J. Comput. 22(6), 1199\u20131217 (1993)","journal-title":"SIAM J. Comput."},{"key":"47_CR8","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. I: the \n                    \n                      \n                    \n                    $$p$$\n                  -centers. SIAM J. Appl. Math. 37(3), 513\u2013538 (1979)"},{"issue":"1","key":"47_CR9","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0304-3975(03)00402-X","volume":"312","author":"S Pettie","year":"2004","unstructured":"Pettie, S.: A new approach to all-pairs shortest paths on real-weighted graphs. Theor. Comp. Sci. 312(1), 47\u201374 (2004)","journal-title":"Theor. Comp. Sci."},{"key":"47_CR10","unstructured":"Tansel, B.C., Francis, R.L., Lowe, T.J.: Location on networks: a survey. Part I: the \n                    \n                      \n                    \n                    $$p$$\n                  -center and \n                    \n                      \n                    \n                    $$p$$\n                  -median problems. Manag. Sci. 29(4), 482\u2013497 (1983)"}],"container-title":["Advances in Intelligent Systems and Computing","Optimization of Complex Systems: Theory, Models, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21803-4_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T05:49:10Z","timestamp":1572587350000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-21803-4_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,15]]},"ISBN":["9783030218027","9783030218034"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21803-4_47","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2019,6,15]]},"assertion":[{"value":"15 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WCGO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"World Congress on Global Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wcgo2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}