{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:27:18Z","timestamp":1743100038516,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319730127"},{"type":"electronic","value":"9783319730134"}],"license":[{"start":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T00:00:00Z","timestamp":1513814400000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-73013-4_33","type":"book-chapter","created":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T19:19:27Z","timestamp":1513797567000},"page":"356-367","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Stabbing Line Segments with Disks: Complexity and Approximation Algorithms"],"prefix":"10.1007","author":[{"given":"Konstantin","family":"Kobylkin","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,21]]},"reference":[{"issue":"5","key":"33_CR1","doi-asserted-by":"publisher","first-page":"1525","DOI":"10.1109\/TNET.2012.2232111","volume":"21","author":"PK Agarwal","year":"2013","unstructured":"Agarwal, P.K., Efrat, A., Ganjugunte, S.K., Hay, D., Sankararaman, S., Zussman, G.: The resilience of WDM networks to probabilistic geographical failures. IEEE\/ACM Trans. Netw. 21(5), 1525\u20131538 (2013)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"2","key":"33_CR2","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.comgeo.2014.08.008","volume":"48","author":"EM Arkin","year":"2015","unstructured":"Arkin, E.M., Anta, A.F., Mitchell, J.S., Mosteiro, M.A.: Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in $$d$$ dimensions. Comput. Geom. 48(2), 134\u2013146 (2015)","journal-title":"Comput. Geom."},{"issue":"3","key":"33_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF02246508","volume":"52","author":"BK Bhattacharya","year":"1994","unstructured":"Bhattacharya, B.K., Jadhav, S., Mukhopadhyay, A., Robert, J.M.: Optimal algorithms for some intersection radius problems. Computing 52(3), 269\u2013279 (1994)","journal-title":"Computing"},{"key":"33_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-319-08404-6_9","volume-title":"Algorithm Theory \u2013 SWAT 2014","author":"P Bose","year":"2014","unstructured":"Bose, P., De Carufel, J.-L., Durocher, S., Taslakian, P.: Competitive online routing on delaunay triangulations. In: Ravi, R., G\u00f8rtz, I.L. (eds.) SWAT 2014. LNCS, vol. 8503, pp. 98\u2013109. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08404-6_9"},{"issue":"3","key":"33_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0925-7721(03)00027-0","volume":"26","author":"P Bose","year":"2003","unstructured":"Bose, P., Kirkpatrick, D.G., Li, Z.: Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces. Comput. Geom. 26(3), 209\u2013219 (2003)","journal-title":"Comput. Geom."},{"issue":"2","key":"33_CR6","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.comgeo.2012.04.001","volume":"47","author":"TM Chan","year":"2014","unstructured":"Chan, T.M., Grant, E.: Exact algorithms and APX-hardness results for geometric packing and covering problems. Comput. Geom. 47(2), 112\u2013124 (2014)","journal-title":"Comput. Geom."},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0925-7721(99)00059-0","volume":"15","author":"A Efrat","year":"2000","unstructured":"Efrat, A., Katz, M.J., Nielsen, F., Sharir, M.: Dynamic data structures for fat objects and their applications. Comput. Geom. 15, 215\u2013227 (2000)","journal-title":"Comput. Geom."},{"issue":"4","key":"33_CR8","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."},{"key":"33_CR9","unstructured":"Hasegawa, T., Masuyama, S., Ibaraki, T.: Computational complexity of the $$m$$-center problems on the plane. Trans. Inst. Electron. Commun. Eng. Japan Sect. E 64(2), 57\u201364 (1981)"},{"key":"33_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/11561071_41","volume-title":"Algorithms \u2013 ESA 2005","author":"D Marx","year":"2005","unstructured":"Marx, D.: Efficient approximation schemes for geometric problems? In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 448\u2013459. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11561071_41"},{"key":"33_CR11","series-title":"NATO ASI Series (Series C: Mathematical and Physical Sciences)","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/978-94-017-3069-3_42","volume-title":"Statistical Extremes and Applications","author":"T Onoyama","year":"1984","unstructured":"Onoyama, T., Sibuya, M., Tanaka, H.: Limit distribution of the minimum distance between independent and identically distributed d-dimensional random variables. In: de Oliveira, J.T. (ed.) Statistical Extremes and Applications. NATO ASI Series (Series C: Mathematical and Physical Sciences), vol. 131, pp. 549\u2013562. Springer, Dordrecht (1984). https:\/\/doi.org\/10.1007\/978-94-017-3069-3_42"},{"key":"33_CR12","volume-title":"Art Gallery Theorems and Algorithms","author":"J O\u2019Rourke","year":"1987","unstructured":"O\u2019Rourke, J.: Art Gallery Theorems and Algorithms. Oxford University Press, New York (1987)"},{"key":"33_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/978-3-662-48350-3_60","volume-title":"Algorithms - ESA 2015","author":"S Har-Peled","year":"2015","unstructured":"Har-Peled, S., Quanrud, K.: Approximation algorithms for polynomial-expansion and low-density graphs. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 717\u2013728. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48350-3_60"},{"issue":"6","key":"33_CR14","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1023\/A:1012319418150","volume":"7","author":"I Stojmenovic","year":"2001","unstructured":"Stojmenovic, I., Urrutia, J., Bose, P., Morin, P.: Routing with guaranteed delivery in ad hoc wireless networks. Wirel. Netw. 7(6), 609\u2013616 (2001)","journal-title":"Wirel. Netw."},{"key":"33_CR15","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1109\/31.34669","volume":"36","author":"R Tamassia","year":"1989","unstructured":"Tamassia, R., Tollis, I.G.: Planar grid embedding in linear time. IEEE Trans. Circ. Syst. 36, 1230\u20131234 (1989)","journal-title":"IEEE Trans. Circ. Syst."}],"container-title":["Lecture Notes in Computer Science","Analysis of Images, Social Networks and Texts"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73013-4_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:15:07Z","timestamp":1710324907000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-73013-4_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,21]]},"ISBN":["9783319730127","9783319730134"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73013-4_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017,12,21]]},"assertion":[{"value":"21 December 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Analysis of Images, Social Networks and Texts","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","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":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aist2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/aistconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}