{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:22:38Z","timestamp":1760440958680},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642190933"},{"type":"electronic","value":"9783642190940"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19094-0_16","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T06:21:40Z","timestamp":1297318900000},"page":"146-157","source":"Crossref","is-referenced-by-count":18,"title":["On the Discrete Unit Disk Cover Problem"],"prefix":"10.1007","author":[{"given":"Gautam K.","family":"Das","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Fraser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alejandro","family":"L\u00f2pez-Ortiz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bradford G.","family":"Nickerson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_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.M.: Exact and approximation algorithms for clustering. Algorithmica\u00a033, 201\u2013226 (2002)","journal-title":"Algorithmica"},{"key":"16_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 algorithms for geometric optimization. ACM Computing Serveys\u00a030, 412\u2013458 (1998)","journal-title":"ACM Computing Serveys"},{"key":"16_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03427-9","volume-title":"Computational Geometry Algorithms and Applications","author":"M. Berg de","year":"1997","unstructured":"de Berg, M., Kreveld, M.V., Overmars, M., Schwarzkopf, O.: Computational Geometry Algorithms and Applications. Springer, Heidelberg (1997)"},{"issue":"1","key":"16_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(1), 463\u2013479 (1995)","journal-title":"Disc. and Comp. Geom."},{"key":"16_CR5","first-page":"77","volume":"2","author":"F. Claude","year":"2010","unstructured":"Claude, F., Das, G.K., Dorrigiv, R., Durocher, S., Fraser, R., Lopez-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":"16_CR6","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 neighbours in wireless ad hoc networks. Mobile Networks and Applications\u00a09, 101\u2013111 (2004)","journal-title":"Mobile Networks and Applications"},{"key":"16_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.\u00a04835, pp. 644\u2013655. Springer, Heidelberg (2007)"},{"issue":"3","key":"16_CR8","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V. Chv\u00e1tal","year":"1979","unstructured":"Chv\u00e1tal, V.: A Greedy Heuristic for the Set-Covering Problem. Mathematics of Operations Research\u00a04(3), 233\u2013235 (1979)","journal-title":"Mathematics of Operations Research"},{"key":"16_CR9","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., Tanimoto, S.: Optimal packing and covering in the plane are NP-complete. Information Processing Letters\u00a012, 133\u2013137 (1981)","journal-title":"Information Processing Letters"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1137\/0216064","volume":"16","author":"G. Frederickson","year":"1987","unstructured":"Frederickson, G.: Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. on Computing\u00a016, 1004\u20131022 (1987)","journal-title":"SIAM J. on Computing"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(91)90075-S","volume":"40","author":"T. Gonzalez","year":"1991","unstructured":"Gonzalez, T.: Covering a set of points in multidimensional space. Information Processing Letters\u00a040, 181\u2013188 (1991)","journal-title":"Information Processing Letters"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D. Hochbaum","year":"1985","unstructured":"Hochbaum, D., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM\u00a032, 130\u2013136 (1985)","journal-title":"J. ACM"},{"key":"16_CR13","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":"16_CR14","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0196-6774(82)90018-9","volume":"3","author":"D.S. Johnson","year":"1982","unstructured":"Johnson, D.S.: The NP-completeness column:An ongoing guide. J. Algorithms\u00a03, 182\u2013195 (1982)","journal-title":"J. Algorithms"},{"key":"16_CR15","unstructured":"Koutis, I., Miller, G.L.: A linear work, o(n 1\/6) time, parallel algorithm for solving planar Laplacians. In: Proc. of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1002\u20131011 (2007)"},{"issue":"4","key":"16_CR16","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. Discrete and Computational Geometry\u00a044(4), 883\u2013895 (2010)","journal-title":"Discrete and Computational Geometry"},{"key":"16_CR17","unstructured":"Narayanappa, S., Vojtechovsky, P.: An improved approximation factor for the unit disk covering problem. In: Proc. of the 18th Canadian Conference on Computational Geometry, pp. 15\u201318 (2006)"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proc. of the 29th ACM Symposium on Theory of Computing, pp. 475\u2013484 (1997)","DOI":"10.1145\/258533.258641"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19094-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,16]],"date-time":"2020-06-16T11:49:28Z","timestamp":1592308168000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19094-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642190933","9783642190940"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19094-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}