{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T12:13:15Z","timestamp":1726056795745},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030333935"},{"type":"electronic","value":"9783030333942"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-33394-2_19","type":"book-chapter","created":{"date-parts":[[2019,10,30]],"date-time":"2019-10-30T17:16:49Z","timestamp":1572455809000},"page":"244-254","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Iterative Methods for Constructing Approximations to Optimal Coverings of Nonconvex Polygons"],"prefix":"10.1007","author":[{"given":"Pavel","family":"Lebedev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir","family":"Ushakov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,27]]},"reference":[{"issue":"7","key":"19_CR1","doi-asserted-by":"publisher","first-page":"1290","DOI":"10.1134\/S0005117917070104","volume":"78","author":"AL Kazakov","year":"2017","unstructured":"Kazakov, A.L., Lebedev, P.D.: Algorithms for constructing optimal $$n$$ -networks in metric spaces. Autom. Remote Control 78(7), 1290\u20131301 (2017)","journal-title":"Autom. Remote Control"},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF01263647","volume":"50","author":"H Melissen","year":"1994","unstructured":"Melissen, H.: Densest packings of eleven congruent circles in a circle. Geom. Dedicata. 50(1), 15\u201325 (1994)","journal-title":"Geom. Dedicata."},{"issue":"1\u20132","key":"19_CR3","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1023\/A:1004224507766","volume":"34","author":"A Heppes","year":"1997","unstructured":"Heppes, A., Melissen, H.: Covering a rectangle with equal circles. Period. Math. Hung. 34(1\u20132), 65\u201381 (1997)","journal-title":"Period. Math. Hung."},{"issue":"6","key":"19_CR4","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1134\/S0005117913060076","volume":"74","author":"AL Kazakov","year":"2013","unstructured":"Kazakov, A.L., Lempert, A.A., Bukharov, D.S.: On segmenting logistical zones for servicing continuously developed consumers. Autom. Remote Control 74(6), 968\u2013977 (2013)","journal-title":"Autom. Remote Control"},{"key":"19_CR5","unstructured":"Desyatov, V.G.: Proektirovanie Sistem Ob\u2019ectov Obshchestvennogo Kompleksa Promyshlennykh Predpriyatiy (Systems Design for Public Service Objects of Industrial Plants). MARKhI, Moscow (1989)"},{"key":"19_CR6","volume-title":"Computational Geometry: An Introduction","author":"FP Preparata","year":"1988","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, New York (1988)"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Dem\u2019yanov, V.F., Vasil\u2019ev, L.V.: Nondifferentiable Optimization. Nauka, Moscow (1981); Springer, New York (1985)","DOI":"10.1007\/978-1-4613-8268-3"},{"key":"19_CR8","unstructured":"Hausdorff, F.: Set Theory. Chelsea Publishing Co., New York (1962); Komkniga, Moscow (2006)"},{"key":"19_CR9","unstructured":"Garkavi, A.L.: On the existence of an optimal network and best diameter of a set in a Banach space. Usp. Mat. Nauk 15(2), 210\u2013211 (1960). (in Russian)"},{"key":"#cr-split#-19_CR10.1","unstructured":"Garkavi, A.L.: The best possible net and the best possible cross-section of a set in a normed space. Am. Math. Soc. Transl. II. Ser. 39, 111-132 (1964)"},{"key":"#cr-split#-19_CR10.2","unstructured":"transl. from Izv. Akad. Nauk SSSR, Ser. Mat. 26(1), 87-106 (1962)"},{"key":"19_CR11","unstructured":"Mestetskiy, L.M.: Continuous Morphology of Binary Images. Figures, skeletons, Circular. Fizmatlit, Moscow (2009). (in Russian)"},{"issue":"2","key":"19_CR12","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0041-5553(71)90161-3","volume":"11","author":"VS Brusov","year":"1971","unstructured":"Brusov, V.S., Piyavskii, S.A.: A computational algorithm for optimally covering a plane region. USSR Comput. Math. Math. Phys. 11(2), 17\u201327 (1971)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Lebedev, P.D., Uspenskii, A.A., Ushakov, V.N.: Algorithms of the best approximations of the flat sets by the union of circles. Vestn. Udmurt. Univ. Mat. Mekh. Komp\u2019yut. Nauki (4), 88\u201399 (2013). (in Russian)","DOI":"10.20537\/vm130409"},{"issue":"1","key":"19_CR14","doi-asserted-by":"publisher","first-page":"S222","DOI":"10.1134\/S0081543815090151","volume":"291","author":"VN Ushakov","year":"2015","unstructured":"Ushakov, V.N., Lakhtin, A.S., Lebedev, P.D.: Optimization of the Hausdorff distance between sets in Euclidean space. Proc. Steklov Inst. Math. 291(1), S222\u2013S238 (2015)","journal-title":"Proc. Steklov Inst. Math."},{"key":"19_CR15","unstructured":"https:\/\/www2.stetson.edu\/~efriedma\/packing.html"},{"issue":"1","key":"19_CR16","doi-asserted-by":"publisher","first-page":"S225","DOI":"10.1134\/S0081543816050205","volume":"293","author":"VN Ushakov","year":"2016","unstructured":"Ushakov, V.N., Lebedev, P.D.: Algorithms for the construction of an optimal cover for sets in three-simensional Euclidean space. Proc. Steklov Inst. Math. 293(1), S225\u2013S237 (2016)","journal-title":"Proc. Steklov Inst. Math."},{"issue":"2","key":"19_CR17","doi-asserted-by":"publisher","first-page":"258","DOI":"10.20537\/vm160212","volume":"26","author":"V.N. Ushakov","year":"2016","unstructured":"Ushakov, V.N., Lebedev, P.D.: Algorithms of optimal set covering on the planar $$\\mathbf{R}^2$$ . Vestn. Udmurt. Univ. Mat. Mekh. Komp\u2019yut. Nauki 26(2), 258\u2013270 (2016). (in Russian)","journal-title":"Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki"},{"key":"19_CR18","unstructured":"Piyavskii, S.A.: On optimization of networks. Izv. Akad. Nauk SSSR Tekh. Kibern. (1), 68\u201380 (1968). (in Russian)"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Fejes T\u00f3th, L.: Lagerungen in der Ebene, auf der Kugel und im Raum. Springer, Berlin (1953); Fizmatlit, Moscow (1958)","DOI":"10.1007\/978-3-662-01206-2"}],"container-title":["Communications in Computer and Information Science","Mathematical Optimization Theory and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-33394-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,3]],"date-time":"2022-10-03T00:30:06Z","timestamp":1664757006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-33394-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030333935","9783030333942"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-33394-2_19","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"27 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MOTOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematical Optimization Theory and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ekaterinburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","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":"12 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"motor2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/motor2019.uran.ru","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"170","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.34","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.64","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}