{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T21:00:45Z","timestamp":1777064445882,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540771180","type":"print"},{"value":"9783540771203","type":"electronic"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-77120-3_56","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T06:31:09Z","timestamp":1196922669000},"page":"644-655","source":"Crossref","is-referenced-by-count":42,"title":["Covering Points by Unit Disks of Fixed Location"],"prefix":"10.1007","author":[{"given":"Paz","family":"Carmi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew J.","family":"Katz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nissan","family":"Lev-Tov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"56_CR1","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.T.: Almost optimal set covers in finite VC-dimension. Discrete Computational Geometry\u00a014, 463\u2013479 (1995)","journal-title":"Discrete Computational Geometry"},{"issue":"2","key":"56_CR2","first-page":"101","volume":"9","author":"G. Calinescu","year":"2004","unstructured":"Calinescu, G., Mandoiu, I.I., Wan, P.-J., Zelikovsky, A.: Selecting forwarding neighbors in wireless ad hoc networks. MONET\u00a09(2), 101\u2013111 (2004)","journal-title":"MONET"},{"key":"56_CR3","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L., Varadarajan, K.: Improved approximation algorithms for geometric set cover. In: Proc. 21st ACM Sympos. Computational Geometry, pp. 135\u2013141 (2005)","DOI":"10.1145\/1064092.1064115"},{"key":"56_CR4","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":"56_CR5","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D.S. Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Maas, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM\u00a032, 130\u2013136 (1985)","journal-title":"J. ACM"},{"key":"56_CR6","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":"56_CR7","unstructured":"Lev-Tov, N.: Algorithms for Geometric Optimization Problems in Wireless Networks. Ph.D. Dissertation, Weizmann Institute of Science (2005)"},{"key":"56_CR8","unstructured":"Narayanappa, S., Vojtechovsky, P.: An improved approximation factor for the unit disk covering problem. In: Proc. 18th Canadian Conf. Computational Geometry, pp. 15\u201318 (2006)"},{"key":"56_CR9","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. 29th ACM Sympos. Theory of Computing, pp. 475\u2013484 (1997)","DOI":"10.1145\/258533.258641"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77120-3_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:27:08Z","timestamp":1558265228000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77120-3_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540771180","9783540771203"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77120-3_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}