{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T14:32:59Z","timestamp":1756996379384,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031324116"},{"type":"electronic","value":"9783031324123"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-32412-3_12","type":"book-chapter","created":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T15:28:05Z","timestamp":1684164485000},"page":"134-145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Covering a\u00a0Set of\u00a0Points with\u00a0a\u00a0Minimum Number of\u00a0Equal Disks via\u00a0Simulated Annealing"],"prefix":"10.1007","author":[{"given":"Stefan M.","family":"Filipov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fani N.","family":"Tomova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,16]]},"reference":[{"issue":"1","key":"12_CR1","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":"12_CR2","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. Inf. Process. Lett. 40(4), 181\u2013188 (1991)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"12_CR3","doi-asserted-by":"publisher","first-page":"1417","DOI":"10.1137\/S0097539702418498","volume":"33","author":"M Charikar","year":"2004","unstructured":"Charikar, M., Chekuri, C., Feder, T., Motwani, R.: Incremental clustering and dynamic information retrieval. SIAM J. Comput. 33(6), 1417\u20131440 (2004)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"12_CR4","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF02570718","volume":"14","author":"H Br\u00f6nnimann","year":"1995","unstructured":"Br\u00f6nnimann, H., Goodrich, M.T.: Almost optimal set covers in finite VC-dimension. Discrete Comput. Geometry 14(4), 463\u2013479 (1995). https:\/\/doi.org\/10.1007\/BF02570718","journal-title":"Discrete Comput. Geometry"},{"key":"12_CR5","unstructured":"Franceschetti, M., Cook, M., Bruck, J.: A geometric theorem for approximate disk covering algorithms (2001)"},{"key":"12_CR6","unstructured":"Liu, P., Lu, D.: A fast 25\/6-approximation for the minimum unit disk cover problem. arXiv preprint arXiv:1406.3838 (2014)"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.comgeo.2016.04.002","volume":"60","author":"A Biniaz","year":"2017","unstructured":"Biniaz, A., Liu, P., Maheshwari, A., Smid, M.: Approximation algorithms for the unit disk cover problem in 2D and 3D. Comput. Geom. 60, 8\u201318 (2017)","journal-title":"Comput. Geom."},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.tcs.2019.12.010","volume":"809","author":"A Dumitrescu","year":"2020","unstructured":"Dumitrescu, A., Ghosh, A., Toth, C.D.: Online unit covering in Euclidean space. Theoret. Comput. Sci. 809, 218\u2013230 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Panov, S.: Finding the minimum number of disks of fixed radius needed to cover a set of points in the plane by MaxiMinMax approach. In: 2022 International Conference Automatics and Informatics (ICAI). IEEE (2022)","DOI":"10.1109\/ICAI55857.2022.9960053"},{"key":"12_CR10","doi-asserted-by":"publisher","unstructured":"Friederich R., Ghosh A., Graham M., Hicks B., Shevchenko R.: Experiments with unit disk cover algorithms for covering massive pointsets. Computat. Geometry 109, 101925 (2023). https:\/\/doi.org\/10.1016\/j.comgeo.2022.101925","DOI":"10.1016\/j.comgeo.2022.101925"},{"issue":"3","key":"12_CR11","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. Inf. Process. Lett. 12(3), 133\u2013137 (1981)","journal-title":"Inf. Process. Lett."},{"key":"12_CR12","unstructured":"Chong, E.K.P., Zak, S.H.: An introduction to optimization, 3rd ed., Wiley (2011)"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Martins, J.R.R.A., Ning, A.: Engineering design optimization. Cambridge University Press (2021)","DOI":"10.1017\/9781108980647"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Griva, I., Nash, S.G., Sofer, A.: Linear and nonlinear optimization. Society For Industrial Mathematics, 2nd ed. (2009)","DOI":"10.1137\/1.9780898717730"},{"issue":"4598","key":"12_CR15","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Jr., Vecchi, M.P.: Optimization by Simulated Annealing. Science 220(4598), 671\u2013680 (1983). https:\/\/doi.org\/10.1126\/science.220.4598.671","journal-title":"Science"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Bertsimas, D., Tsitsiklis, J.: Simulated annealing. Statistical Sci. 8(1), 10\u201315 (1993). https:\/\/www.jstor.org\/stable\/2246034","DOI":"10.1214\/ss\/1177011077"},{"key":"12_CR17","doi-asserted-by":"publisher","unstructured":"Filipov, S.M., Panov, S.M., Tomova, F.N., Kuzmanova, V.D.: Maximal covering of a point set by a system of disks via simulated annealing. In: 2021 International Conference Automatics and Informatics (ICAI), pp. 261\u2013269. IEEE (2021). https:\/\/doi.org\/10.1109\/ICAI52893.2021.9639536","DOI":"10.1109\/ICAI52893.2021.9639536"},{"key":"12_CR18","doi-asserted-by":"publisher","unstructured":"Frenkel, D., Smit, B.: Understanding molecular simulation: from algorithms to applications (2002). https:\/\/doi.org\/10.1016\/B978-0-12-267351-1.X5000-7","DOI":"10.1016\/B978-0-12-267351-1.X5000-7"}],"container-title":["Lecture Notes in Computer Science","Numerical Methods and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-32412-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,8]],"date-time":"2023-07-08T20:23:42Z","timestamp":1688847822000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32412-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031324116","9783031324123"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32412-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"16 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Numerical Methods and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Borovets","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bulgaria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nma2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.math.bas.bg\/~nummeth\/nma22\/Publications.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}