{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:42:41Z","timestamp":1743025361886,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030535513"},{"type":"electronic","value":"9783030535520"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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-53552-0_7","type":"book-chapter","created":{"date-parts":[[2020,7,17]],"date-time":"2020-07-17T16:50:23Z","timestamp":1595004623000},"page":"46-51","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Practical Approximation Algorithms for Stabbing Special Families of Line Segments with Equal Disks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9282-1046","authenticated-orcid":false,"given":"Konstantin","family":"Kobylkin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0288-851X","authenticated-orcid":false,"given":"Irina","family":"Dryakhlova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,18]]},"reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00454-010-9323-7","volume":"47","author":"N Alon","year":"2011","unstructured":"Alon, N.: A non-linear lower bound for planar epsilon-nets. Discrete Comput. Geom. 47(2), 235\u2013244 (2011). \nhttps:\/\/doi.org\/10.1007\/s00454-010-9323-7","journal-title":"Discrete Comput. Geom."},{"issue":"5","key":"7_CR2","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1007\/s11276-012-0506-4","volume":"19","author":"D Dash","year":"2012","unstructured":"Dash, D., Bishnu, A., Gupta, A., Nandy, S.: Approximation algorithms for deployment of sensors for line segment coverage in wireless sensor networks. Wirel. Netw. 19(5), 857\u2013870 (2012). \nhttps:\/\/doi.org\/10.1007\/s11276-012-0506-4","journal-title":"Wirel. Netw."},{"issue":"9","key":"7_CR3","doi-asserted-by":"publisher","first-page":"1502","DOI":"10.1109\/5.163414","volume":"80","author":"J Jaromczyk","year":"1992","unstructured":"Jaromczyk, J., Toussaint, G.: Relative neighborhood graphs and their relatives. Proc. IEEE 80(9), 1502\u20131517 (1992). \nhttps:\/\/doi.org\/10.1109\/5.163414","journal-title":"Proc. IEEE"},{"key":"7_CR4","unstructured":"Karavelas, M.I.: A robust and efficient implementation for the segment Voronoi diagram. In: Proceedings of the 1st International Symposium on Voronoi Diagrams in Science and Engineering, Tokyo, pp. 51\u201362 (2004)"},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Kobylkin, K.: Stabbing line segments with disks: complexity and approximation algorithms. In: van der Aalst, W., et al. (eds.) International Conference on Analysis of Images, Social Networks and Texts, AIST 2017. LNCS, vol. 10716, pp. 356\u2013367. Springer, Heidelberg (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-73013-4_33","DOI":"10.1007\/978-3-319-73013-4_33"},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Kobylkin, K.: Constant factor approximation for intersecting line segments with disks. In: Battiti, R., Brunato, M., Kotsireas, I., Pardalos, P. (eds.) Learning and Intelligent Optimization, LION 2018. LNCS, vol. 11353, pp. 447\u2013454. Springer, Heidelberg (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-030-05348-2_39","DOI":"10.1007\/978-3-030-05348-2_39"},{"key":"7_CR7","unstructured":"Kobylkin, K.: Efficient constant factor approximation algorithms for stabbing line segments with equal disks. CoRR abs\/1803.08341 (2018). 31 p. \nhttps:\/\/arxiv.org\/pdf\/1803.08341.pdf"},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Kobylkin, K., Dryakhlova, I.: Approximation algorithms for piercing special families of hippodromes: an extended abstract. In: Khachay, M., Kochetov, Y., Pardalos, P. (eds.) Mathematical Optimization Theory and Operations Research, MOTOR 2019. LNCS, vol. 11548, pp. 565-580. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-22629-9_40","DOI":"10.1007\/978-3-030-22629-9_40"},{"issue":"3","key":"7_CR9","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1111\/j.1538-4632.1980.tb00031.x","volume":"12","author":"D Matula","year":"1980","unstructured":"Matula, D., Sokal, R.: Properties of Gabriel graphs relevant to geographic variation research and the clustering of points in the plane. Geogr. Anal. 12(3), 205\u2013222 (1980). \nhttps:\/\/doi.org\/10.1111\/j.1538-4632.1980.tb00031.x","journal-title":"Geogr. Anal."},{"key":"7_CR10","unstructured":"Madireddy, R., Mudgal, A.: Stabbing line segments with disks and related problems. In: Proceedings of the 28th Canadian Conference on Computational Geometry, pp. 201\u2013207. Simon Fraser University, Vancouver, Canada (2016)"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-53552-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,17]],"date-time":"2020-07-17T16:55:32Z","timestamp":1595004932000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-53552-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030535513","9783030535520"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-53552-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"18 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.caopt.com\/LION14\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}