{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:20:59Z","timestamp":1760440859563},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642106309"},{"type":"electronic","value":"9783642106316"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10631-6_7","type":"book-chapter","created":{"date-parts":[[2009,12,4]],"date-time":"2009-12-04T07:03:43Z","timestamp":1259910223000},"page":"45-54","source":"Crossref","is-referenced-by-count":7,"title":["Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm"],"prefix":"10.1007","author":[{"given":"Francisco","family":"Claude","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reza","family":"Dorrigiv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephane","family":"Durocher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Fraser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alejandro","family":"L\u00f3pez-Ortiz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alejandro","family":"Salinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","first-page":"201","volume":"33","author":"P. Agarwal","year":"2002","unstructured":"Agarwal, P., Procopiuc, C.: Exact and approximation algorithms for clustering. Alg.\u00a033, 201\u2013226 (2002)","journal-title":"Alg."},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1145\/299917.299918","volume":"30","author":"P. Agarwal","year":"1998","unstructured":"Agarwal, P., Sharir, M.: Efficient algorithms for geometric optimization. ACM Comp. Surv.\u00a030, 412\u2013458 (1998)","journal-title":"ACM Comp. Surv."},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Amb\u00fchl, C., Erlebach, T., Mihal\u2019\u00e1k, M., Nunkesser, M.: Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. In: Proc. of Approx., Rand., and Comb. Opt. Alg. and Tech., pp. 3\u201314 (2006)","DOI":"10.1007\/11830924_3"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Carmi, P., Katz, M., Lev-Tov, N.: Covering points by unit disks of fixed location. In: Proc. Int\u2019l Symp. on Alg. and Comp., pp. 644\u2013655 (2007)","DOI":"10.1007\/978-3-540-77120-3_56"},{"issue":"1","key":"7_CR5","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s00454-006-1273-8","volume":"37","author":"K. Clarkson","year":"2007","unstructured":"Clarkson, K., Varadarajan, K.: Improved approximation algorithms for geometric set cover. Disc. and Comp. Geom.\u00a037(1), 43\u201358 (2007)","journal-title":"Disc. and Comp. Geom."},{"issue":"2","key":"7_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. Mob. Net. and Appl.\u00a09(2), 101\u2013111 (2004)","journal-title":"Mob. Net. and Appl."},{"issue":"3","key":"7_CR7","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. Inf. Proc. Lett.\u00a012(3), 133\u2013137 (1981)","journal-title":"Inf. Proc. Lett."},{"issue":"6","key":"7_CR8","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 Comp.\u00a016(6), 1004\u20131022 (1987)","journal-title":"SIAM J. on Comp."},{"key":"7_CR9","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":"7_CR10","first-page":"398","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. Alg.\u00a09, 398\u2013423 (1993)","journal-title":"Alg."},{"issue":"2","key":"7_CR11","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0196-6774(82)90018-9","volume":"3","author":"D. Johnson","year":"1982","unstructured":"Johnson, D.: The NP-completeness column: An ongoing guide. J. of Alg.\u00a03(2), 182\u2013195 (1982)","journal-title":"J. of Alg."},{"key":"7_CR12","unstructured":"Koutis, I., Miller, G.: A linear work, o(n 1\/6) time, parallel algorithm for solving planar Laplacians. In: Proc. Symp. Disc. Alg., pp. 1002\u20131011 (2007)"},{"key":"7_CR13","unstructured":"Lev-Tov, N.: Algorithms for Geometric Optimization Problems in Wireless Networks. Ph.D. thesis, Weizmann Institute of Science (2005)"},{"key":"7_CR14","unstructured":"Mustafa, N., Ray, S.: Improved results on geometric hitting set problems (2009), http:\/\/www.mpi-inf.mpg.de\/~saurabh\/Papers\/Hitting-Sets.pdf"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Mustafa, N., Ray, S.: PTAS for geometric hitting set problems via local search. In: Proc. Symp. on Comp. Geom., pp. 17\u201322 (2009)","DOI":"10.1145\/1542362.1542367"},{"key":"7_CR16","unstructured":"Narayanappa, S., Voytechovsky, P.: An improved approximation factor for the unit disk covering problem. In: Proc. Can. Conf. Comp. Geom. (2006)"},{"key":"7_CR17","unstructured":"Supowit, K.: Topics in Computational Geometry. Ph.D. thesis, University of Illinois at Urbana-Champaign (1981)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10631-6_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:32:21Z","timestamp":1606185141000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10631-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642106309","9783642106316"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10631-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}