{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:25:27Z","timestamp":1725733527632},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642396427"},{"type":"electronic","value":"9783642396434"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39643-4_6","type":"book-chapter","created":{"date-parts":[[2013,6,21]],"date-time":"2013-06-21T00:58:56Z","timestamp":1371776336000},"page":"73-85","source":"Crossref","is-referenced-by-count":5,"title":["Unit Disk Cover Problem in 2D"],"prefix":"10.1007","author":[{"given":"Rashmisnata","family":"Acharyya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manjanna","family":"Basappa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gautam K.","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s00453-001-0110-y","volume":"33","author":"P.K. Agarwal","year":"2002","unstructured":"Agarwal, P.K., Procopiuc, C.: Exact and approximation algorithms for clustering. Algorithmica\u00a033, 201\u2013226 (2002)","journal-title":"Algorithmica"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1145\/299917.299918","volume":"30","author":"P.K. Agarwal","year":"1998","unstructured":"Agarwal, P.K., Sharir, M.: Efficient algorithm for geometric optimization. ACM Comp. Surv.\u00a030, 412\u2013458 (1998)","journal-title":"ACM Comp. Surv."},{"key":"6_CR3","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 2006 and RANDOM 2006. LNCS, vol.\u00a04110, pp. 3\u201314. Springer, Heidelberg (2006)"},{"key":"6_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.: Almost optimal set covers in finite VC-dimension. Disc. and Comp. Geom.\u00a014, 463\u2013479 (1995)","journal-title":"Disc. and Comp. Geom."},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/3-540-44634-6_17","volume-title":"Algorithms and Data Structures","author":"P. Bose","year":"2001","unstructured":"Bose, P., Maheshwari, A., Morin, P., Morrison, J.: The grid placement problem. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol.\u00a02125, pp. 180\u2013191. Springer, Heidelberg (2001)"},{"key":"6_CR6","first-page":"77","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. Disc. Math., Alg., and Appl.\u00a02, 77\u201387 (2010)","journal-title":"Disc. Math., Alg., and Appl."},{"key":"6_CR7","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., Wan, P.J., Zelikovsky, A.: Selecting forwarding neighbors in wireless ad hoc networks. Mob. Net. and Appl.\u00a09, 101\u2013111 (2004)","journal-title":"Mob. Net. and Appl."},{"key":"6_CR8","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.\u00a04835, pp. 644\u2013655. Springer, Heidelberg (2007)"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.comgeo.2009.06.005","volume":"43","author":"G.K. Das","year":"2010","unstructured":"Das, G.K., Das, S., Nandy, S.C.: Homogeneous 2-hop broadcast in 2D. Comp. Geom.: Theo. and Appl.\u00a043, 182\u2013190 (2010)","journal-title":"Comp. Geom.: Theo. and Appl."},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1142\/S0218195912500094","volume":"22","author":"G.K. 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. Comp. Geom. and Appl.\u00a022, 407\u2013420 (2012)","journal-title":"Int. J. Comp. Geom. and Appl."},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s11276-006-3724-9","volume":"13","author":"S. Funke","year":"2007","unstructured":"Funke, S., Kesseelman, A., Kuhn, F., Lotker, Z., Segal, M.: Improved approximation algorithms for connected sensor cover. Wir. Net.\u00a013, 153\u2013164 (2007)","journal-title":"Wir. Net."},{"key":"6_CR12","unstructured":"Fraser, R., L\u00f3pez-Ortiz, A.: The within-strip discrete unit disk cover problem. In: 24th Canadian Conference on Computational Geometry, pp. 61\u201366 (2012)"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","volume":"12","author":"R. Fowler","year":"1981","unstructured":"Fowler, R., Paterson, M., Tanimato, S.: Optimal packing and covering in the plane are NP-complete. Inf. Proc. Let.\u00a012, 133\u2013137 (1981)","journal-title":"Inf. Proc. Let."},{"key":"6_CR14","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. 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)"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/BF01228511","volume":"9","author":"R. Hwang","year":"1993","unstructured":"Hwang, R., Lee, R., Chang, R.: The generalized searching over separators strategy to solve some NP-hard problems in subexponential time. Algorithmica\u00a09, 398\u2013423 (1993)","journal-title":"Algorithmica"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D.S. Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. of ACM\u00a032, 130\u2013136 (1985)","journal-title":"J. of ACM"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1007\/s00454-010-9285-9","volume":"44","author":"N.H. Mustafa","year":"2010","unstructured":"Mustafa, N.H., Ray, S.: Improved results on geometric hitting set problems. Disc. and Comp. Geom.\u00a044, 883\u2013895 (2010)","journal-title":"Disc. and Comp. Geom."},{"key":"6_CR18","unstructured":"Narayanappa, S., Vojtechovsky, P.: An improved approximation factor for the unit disk covering problem. In: 18th Canadian Conference on Computational Geometry, pp. 15\u201318 (2006)"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"1399","DOI":"10.1109\/TMC.2011.126","volume":"11","author":"D. Yang","year":"2012","unstructured":"Yang, D., Misra, S., Fang, X., Xue, G., Zhang, J.: Two-tiered constrained relay node placement in wireless sensor networks: computational complexity and efficient approximations. IEEE Trans. on Mob. Comp.\u00a011, 1399\u20131411 (2012)","journal-title":"IEEE Trans. on Mob. Comp."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39643-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T07:55:15Z","timestamp":1557820515000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39643-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642396427","9783642396434"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39643-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}