{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:15:45Z","timestamp":1742976945573,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319741796"},{"type":"electronic","value":"9783319741802"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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-74180-2_7","type":"book-chapter","created":{"date-parts":[[2018,1,15]],"date-time":"2018-01-15T15:12:55Z","timestamp":1516029175000},"page":"81-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Line Segment Disk Cover"],"prefix":"10.1007","author":[{"given":"Manjanna","family":"Basappa","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,16]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/11830924_3","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"C Amb\u00fchl","year":"2006","unstructured":"Amb\u00fchl, C., Erlebach, T., Mihal\u00e1k, M., Nunkesser, M.: Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. In: D\u00edaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX\/RANDOM-2006. LNCS, vol. 4110, pp. 3\u201314. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11830924_3"},{"issue":"5","key":"7_CR2","doi-asserted-by":"publisher","first-page":"1423","DOI":"10.1016\/j.cor.2008.02.013","volume":"36","author":"A Agnetis","year":"2009","unstructured":"Agnetis, A., Grande, E., Mirchandani, P.B., Pacifici, A.: Covering a line segment with variable radius discs. Comput. Oper. Res. 36(5), 1423\u20131436 (2009)","journal-title":"Comput. Oper. Res."},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Acharyya, A., Nandy, S.C., Pandit, S., Roy, S.: Covering segments with unit squares. In: Workshop on Algorithms and Data Structures, pp. 1\u201312 (2017)","DOI":"10.1007\/978-3-319-62127-2_1"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.jda.2015.05.002","volume":"33","author":"M Basappa","year":"2015","unstructured":"Basappa, M., Acharyya, R., Das, G.K.: Unit disk cover problem in 2D. J. Discrete Algorithms 33, 193\u2013201 (2015)","journal-title":"J. Discrete Algorithms"},{"key":"7_CR5","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.: Almost optimal set covers in finite VC-dimension. Disc. Comput. Geom. 14, 463\u2013479 (1995)","journal-title":"Disc. Comput. Geom."},{"issue":"1","key":"7_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1142\/S1793830910000486","volume":"2","author":"F Claude","year":"2010","unstructured":"Claude, F., Das, G.K., Dorrigiv, R., Durocher, S., Fraser, R., L\u00f3pez-Ortiz, A., Nickerson, B.G., Salinger, A.: An improved line-separable algorithm for discrete unit disk cover. Discrete Math. Algorithms Appl. 2(1), 77\u201387 (2010)","journal-title":"Discrete Math. Algorithms Appl."},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1007\/978-3-540-77120-3_56","volume-title":"Algorithms and Computation","author":"P Carmi","year":"2007","unstructured":"Carmi, P., Katz, M.J., Lev-Tov, N.: Covering points by unit disks of fixed location. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 644\u2013655. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77120-3_56"},{"issue":"2","key":"7_CR8","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/B:MONE.0000013622.63511.57","volume":"9","author":"G C\u0103linescu","year":"2004","unstructured":"C\u0103linescu, G., M\u0103ndoiu, I.I., Wan, P.J., Zelikovsky, A.Z.: Selecting forwarding neighbors in wireless ad hoc networks. Mob. Netw. Appl. 9(2), 101\u2013111 (2004)","journal-title":"Mob. Netw. Appl."},{"issue":"5","key":"7_CR9","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1007\/s11276-012-0506-4","volume":"19","author":"D Dash","year":"2013","unstructured":"Dash, D., Bishnu, A., Gupta, A., Nandy, S.C.: Approximation algorithms for deployment of sensors for line segment coverage in wireless sensor networks. Wirel. Netw. 19(5), 857\u2013870 (2013)","journal-title":"Wirel. Netw."},{"issue":"5","key":"7_CR10","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1142\/S0218195912500094","volume":"22","author":"GK Das","year":"2012","unstructured":"Das, G.K., Fraser, R., L\u00f3pez-Ortiz, A., Nickerson, B.G.: On the discrete unit disk cover problem. Int. J. Comput. Geom. Appl. 22(5), 407\u2013420 (2012)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"7","key":"7_CR11","doi-asserted-by":"publisher","first-page":"2596","DOI":"10.1016\/j.jpdc.2014.03.004","volume":"74","author":"D Dash","year":"2014","unstructured":"Dash, D., Gupta, A., Bishnu, A., Nandy, S.C.: Line coverage measures in wireless sensor networks. J. Parallel Distrib. Comput. 74(7), 2596\u20132614 (2014)","journal-title":"J. Parallel Distrib. Comput."},{"key":"7_CR12","unstructured":"Fraser, R., L\u00f3pez-Ortiz, A.: The within-strip discrete unit disk cover problem. In: Proceedings of Canadian Conference on Computational Geometry, pp. 61\u201366 (2012)"},{"key":"7_CR13","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"issue":"4","key":"7_CR14","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1007\/s00454-010-9285-9","volume":"44","author":"NH Mustafa","year":"2010","unstructured":"Mustafa, N.H., Ray, S.: Improved results on geometric hitting set problems. Discrete Comput. Geom. 44(4), 883\u2013895 (2010)","journal-title":"Discrete Comput. Geom."},{"key":"7_CR15","unstructured":"Narayanappa, S., Vojtechovsk\u1ef3 P.: An improved approximation factor for the unit disk covering problem. In: Proceedings of Canadian Conference on Computational Geometry, pp. 15\u201318 (2006)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-74180-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:51:00Z","timestamp":1709826660000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-74180-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319741796","9783319741802"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-74180-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"16 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guwahati","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 February 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 February 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitg.ac.in\/caldam2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}