{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:43:32Z","timestamp":1740109412432,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T00:00:00Z","timestamp":1528675200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100006115","name":"Institute for Research in Fundamental Sciences","doi-asserted-by":"crossref","award":["CS1397-4-64"],"award-info":[{"award-number":["CS1397-4-64"]}],"id":[{"id":"10.13039\/501100006115","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s00224-018-9870-5","type":"journal-article","created":{"date-parts":[[2018,6,10]],"date-time":"2018-06-10T21:33:26Z","timestamp":1528666406000},"page":"2035-2047","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Most Points Connected-Covering Problem with Two Disks"],"prefix":"10.1007","volume":"62","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2861-316X","authenticated-orcid":false,"given":"Sanaz","family":"Soltani","sequence":"first","affiliation":[]},{"given":"Mohammadreza","family":"Razzazi","sequence":"additional","affiliation":[]},{"given":"Hossein","family":"Ghasemalizadeh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,11]]},"reference":[{"issue":"3","key":"9870_CR1","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","volume":"12","author":"RJ Fowler","year":"1981","unstructured":"Fowler, R.J., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. Inform. Process. Lett. 12(3), 133\u2013137 (1981)","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"9870_CR2","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM (JACM) 32(1), 130\u2013136 (1985)","journal-title":"J. ACM (JACM)"},{"issue":"4","key":"9870_CR3","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(91)90075-S","volume":"40","author":"TF Gonzalez","year":"1991","unstructured":"Gonzalez, T.F.: Covering a set of points in multidimensional space. Inform. Process. Lett. 40(4), 181\u2013188 (1991)","journal-title":"Inform. Process. Lett."},{"key":"9870_CR4","doi-asserted-by":"crossref","unstructured":"Fu, B.: Theory and application of width bounded geometric separator. In: STACS. Springer, pp. 277\u2013288 (2006)","DOI":"10.1007\/11672142_22"},{"issue":"1","key":"9870_CR5","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.jalgor.2004.04.002","volume":"53","author":"R Gandhi","year":"2004","unstructured":"Gandhi, R., Khuller, S., Srinivasan, A.: Approximation algorithms for partial covering problems. J. Algorithm. 53(1), 55\u201384 (2004)","journal-title":"J. Algorithm."},{"issue":"3","key":"9870_CR6","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/s00224-008-9135-9","volume":"45","author":"M Berg de","year":"2009","unstructured":"de Berg, M., Cabello, S., Har-Peled, S.: Covering many or few points with unit disks. Theory Comput. Syst. 45(3), 446\u2013469 (2009)","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"9870_CR7","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.comgeo.2012.06.002","volume":"46","author":"S Cabello","year":"2013","unstructured":"Cabello, S., D\u00edaz-B\u00e1\u00f1ez, J.M., P\u00e9rez-Lantero, P.: Covering a bichromatic point set with two disjoint monochromatic disks. Comput. Geom. 46(3), 203\u2013212 (2013)","journal-title":"Comput. Geom."},{"issue":"3","key":"9870_CR8","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.comgeo.2007.10.001","volume":"40","author":"S Cabello","year":"2008","unstructured":"Cabello, S., D\u00edaz-B\u00e1\u00f1ez, J.M., Seara, C., Sellares, J.A., Urrutia, J., Ventura, I.: Covering point sets with two disjoint disks or squares. Comput. Geom. 40(3), 195\u2013206 (2008)","journal-title":"Comput. Geom."},{"issue":"3","key":"9870_CR9","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.comgeo.2012.09.006","volume":"46","author":"B Aronov","year":"2013","unstructured":"Aronov, B., Dulieu, M.: How to cover a point set with a v-shape of minimum width. Comput. Geom. 46(3), 298\u2013309 (2013)","journal-title":"Comput. Geom."},{"key":"9870_CR10","unstructured":"Kar, K., Banerjee, S., et al.: Node Placement for Connected Coverage in Sensor Networks. In: Wiopt\u201903: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (2003)"},{"key":"9870_CR11","doi-asserted-by":"crossref","unstructured":"Ghosh, A., Das, S.K.: Coverage and connectivity issues in wireless sensor networks, Mobile, Wireless, and Sensor Networks: Technology, Applications, and Future Directions, pp. 221\u2013256 (2006)","DOI":"10.1002\/0471755591.ch9"},{"issue":"4","key":"9870_CR12","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0020-0190(02)00402-7","volume":"85","author":"P-H Huang","year":"2003","unstructured":"Huang, P. -H., Tsai, Y.T., Tang, C.Y.: A fast algorithm for the alpha-connected two-center decision problem. Inform. Process. Lett. 85(4), 205\u2013210 (2003)","journal-title":"Inform. Process. Lett."},{"issue":"7","key":"9870_CR13","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1287\/mnsc.27.7.848","volume":"27","author":"Z Drezner","year":"1981","unstructured":"Drezner, Z.: Note\u2014on a modified one-center model. Manag. Sci. 27(7), 848\u2013851 (1981)","journal-title":"Manag. Sci."},{"key":"9870_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-33259-6","volume-title":"Effective computational geometry for curves and surfaces","author":"J-D Boissonnat","year":"2006","unstructured":"Boissonnat, J.-D., Teillaud, M.: Effective computational geometry for curves and surfaces. Springer, Berlin (2006)"},{"issue":"1-2","key":"9870_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02238188","volume":"36","author":"BM Chazelle","year":"1986","unstructured":"Chazelle, B.M., Lee, D.-T.: On a circle placement problem. Computing 36 (1-2), 1\u201316 (1986)","journal-title":"Computing"},{"issue":"1","key":"9870_CR16","first-page":"309","volume":"17","author":"H Ghasemalizadeh","year":"2015","unstructured":"Ghasemalizadeh, H., Razzazi, M.: Output sensitive algorithm for covering many points. Discret. Math. Theor. Comput. Sci. 17(1), 309\u2013316 (2015)","journal-title":"Discret. Math. Theor. Comput. Sci."},{"issue":"3","key":"9870_CR17","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s00224-011-9353-4","volume":"50","author":"H Ghasemalizadeh","year":"2012","unstructured":"Ghasemalizadeh, H., Razzazi, M.: An improved approximation algorithm for the most points covering problem. Theory Comput. Syst. 50(3), 545\u2013558 (2012)","journal-title":"Theory Comput. Syst."},{"key":"9870_CR18","doi-asserted-by":"crossref","unstructured":"De Berg, M., Van Kreveld, M., Overmars, M., Schwarzkopf, O.C.: Computational geometry. Springer, Berlin (2000)","DOI":"10.1007\/978-3-662-04245-8"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-018-9870-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-018-9870-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-018-9870-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T19:06:00Z","timestamp":1560193560000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-018-9870-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,11]]},"references-count":18,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["9870"],"URL":"https:\/\/doi.org\/10.1007\/s00224-018-9870-5","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2018,6,11]]},"assertion":[{"value":"11 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}