{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:28:09Z","timestamp":1758274089522,"version":"3.37.3"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,11,7]],"date-time":"2018-11-07T00:00:00Z","timestamp":1541548800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61628207"],"award-info":[{"award-number":["61628207"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","award":["201706240214"],"award-info":[{"award-number":["201706240214"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["2012017yjsy219"],"award-info":[{"award-number":["2012017yjsy219"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71371129"],"award-info":[{"award-number":["71371129"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100012906","name":"Department of Education of Shandong Province","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100012906","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s10878-018-0359-6","type":"journal-article","created":{"date-parts":[[2018,11,7]],"date-time":"2018-11-07T02:11:35Z","timestamp":1541556695000},"page":"1408-1423","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient algorithms for computing one or two discrete centers hitting a set of line segments"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6880-107X","authenticated-orcid":false,"given":"Xiaozhou","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhihui","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bing","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feifeng","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,7]]},"reference":[{"issue":"3","key":"359_CR1","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/PL00009387","volume":"20","author":"PK Agarwal","year":"1998","unstructured":"Agarwal PK, Sharir M, Welzl E (1998) The discrete 2-center problem. Discrete Comput Geom 20(3):287\u2013305","journal-title":"Discrete Comput Geom"},{"issue":"3","key":"359_CR2","first-page":"189","volume":"13","author":"TM Chan","year":"1999","unstructured":"Chan TM (1999) More planar two-center algorithms. Comput Geom 13(3):189\u2013198","journal-title":"More planar two-center algorithms. Comput Geom"},{"key":"359_CR3","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms, 2nd edn. MIT Press"},{"issue":"2","key":"359_CR4","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1002\/1520-6750(198704)34:2<229::AID-NAV3220340207>3.0.CO;2-1","volume":"34","author":"Z Drezner","year":"1987","unstructured":"Drezner Z (1987) On the rectangular p-center problem. Naval Res Log (NRL) 34(2):229\u2013234","journal-title":"Naval Res Log (NRL)"},{"issue":"3","key":"359_CR5","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/s10878-012-9532-5","volume":"27","author":"H Du","year":"2014","unstructured":"Du H, Xu Y (2014) An approximation algorithm for k-center problem on a convex polygon. J Comb Optim 27(3):504\u2013518","journal-title":"J Comb Optim"},{"key":"359_CR6","first-page":"131","volume":"97","author":"D Eppstein","year":"1997","unstructured":"Eppstein D (1997) Faster construction of planar two-centers. SODA 97:131\u2013138","journal-title":"SODA"},{"issue":"3","key":"359_CR7","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.comgeo.2004.12.002","volume":"31","author":"M Hoffmann","year":"2005","unstructured":"Hoffmann M (2005) A simple linear algorithm for computing rectilinear 3-centers. Comput Geom 31(3):150\u2013165","journal-title":"Comput Geom"},{"issue":"4","key":"359_CR8","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0925-7721(99)00052-8","volume":"15","author":"MJ Katz","year":"2000","unstructured":"Katz MJ, Kedem K, Segal M (2000) Discrete rectilinear 2-center problems. Comput Geom 15(4):203\u2013214","journal-title":"Comput Geom"},{"issue":"4","key":"359_CR9","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N Megiddo","year":"1983","unstructured":"Megiddo N (1983) Linear-time algorithms for linear programming in \n                    \n                      \n                    \n                    $$\\text{ r }^{3}$$\n                    \n                      \n                        \n                          \n                          r\n                          \n                            \n                            3\n                          \n                        \n                      \n                    \n                   and related problems. SIAM J Comput 12(4):759\u2013776","journal-title":"SIAM J Comput"},{"key":"359_CR10","doi-asserted-by":"crossref","unstructured":"Sadhu S, Roy S, Nandy SC, Roy S (2017) Optimal covering and hitting of line segments by two axis-parallel squares. In: International computing and combinatorics conference. Springer, pp 457\u2013468","DOI":"10.1007\/978-3-319-62389-4_38"},{"issue":"2","key":"359_CR11","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/PL00009311","volume":"18","author":"M Sharir","year":"1997","unstructured":"Sharir M (1997) A near-linear algorithm for the planar 2-center problem. Discrete Comput Geom 18(2):125\u2013134","journal-title":"Discrete Comput Geom"},{"key":"359_CR12","doi-asserted-by":"crossref","unstructured":"Welzl E (1991) Smallest enclosing disks (balls and ellipsoids). In: New results and new trends in computer science. LNCS 555, Springer, pp 359\u2013370","DOI":"10.1007\/BFb0038202"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0359-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0359-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0359-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T19:10:42Z","timestamp":1573067442000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0359-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,7]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["359"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0359-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2018,11,7]]},"assertion":[{"value":"7 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}