{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:22:29Z","timestamp":1760440949988},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153686"},{"type":"electronic","value":"9783642153693"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15369-3_13","type":"book-chapter","created":{"date-parts":[[2010,8,27]],"date-time":"2010-08-27T00:01:36Z","timestamp":1282867296000},"page":"166-177","source":"Crossref","is-referenced-by-count":13,"title":["PTAS for Weighted Set Cover on Unit Squares"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Erlebach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik Jan","family":"van Leeuwen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_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 2006 and RANDOM 2006. LNCS, vol.\u00a04110, pp. 3\u201314. Springer, Heidelberg (2006)"},{"issue":"1","key":"13_CR2","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 Comput. Geom.\u00a014(1), 463\u2013479 (1995)","journal-title":"Discrete Comput. Geom."},{"key":"13_CR3","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":"13_CR4","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. Math. Oper. Research\u00a04(3), 233\u2013235 (1979)","journal-title":"Math. Oper. Research"},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s00454-006-1273-8","volume":"37","author":"K.L. Clarkson","year":"2007","unstructured":"Clarkson, K.L., Varadarajan, K.R.: Improved Approximation Algorithms for Geometric Set Cover. Discrete Comput. Geom.\u00a037(1), 43\u201358 (2007)","journal-title":"Discrete Comput. Geom."},{"key":"13_CR6","first-page":"34","volume-title":"Proc. DIAL-M 2001","author":"G. C\u0103linescu","year":"2001","unstructured":"C\u0103linescu, G., Mandoiu, I.I., Wan, P.J., Zelikovsky, A.: Selecting forwarding neighbors in wireless ad hoc networks. In: Proc. DIAL-M 2001, pp. 34\u201343. ACM, New York (2001)"},{"issue":"8-10","key":"13_CR7","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1016\/j.tcs.2008.11.015","volume":"410","author":"D. Dai","year":"2009","unstructured":"Dai, D., Yu, C.: A 5\u2009+\u2009\u03b5-approximation algorithm for minimum weighted dominating set in unit disk graph. Theoret. Comput. Sci.\u00a0410(8-10), 756\u2013765 (2009)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/PL00009494","volume":"23","author":"A. Efrat","year":"2000","unstructured":"Efrat, A., Sharir, M.: The Complexity of the Union of Fat Objects in the Plane. Discrete Comput. Geom.\u00a023(2), 171\u2013189 (2000)","journal-title":"Discrete Comput. Geom."},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/978-3-642-12450-1_13","volume-title":"WAOA 2009","author":"T. Erlebach","year":"2010","unstructured":"Erlebach, T., Mihal\u00e1k, M.: A (4+epsilon)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs. In: Bampis, E., Jansen, K. (eds.) WAOA 2009. LNCS, vol.\u00a05893, pp. 135\u2013146. Springer, Heidelberg (2010)"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1007\/978-3-540-78773-0_64","volume-title":"LATIN 2008: Theoretical Informatics","author":"T. Erlebach","year":"2008","unstructured":"Erlebach, T., van Leeuwen, E.J.: Domination in Geometric Intersection Graphs. In: Laber, E.S., Bornstein, C.F., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.\u00a04957, pp. 747\u2013758. Springer, Heidelberg (2008)"},{"issue":"4","key":"13_CR11","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A Threshold of ln n for Approximating Set Cover. J. ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"issue":"3","key":"13_CR12","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","volume":"12","author":"R.J. Fowler","year":"1981","unstructured":"Fowler, R.J., Paterson, M.S., Tanimoto, S.L.: Optimal Packing and Covering in the Plane are NP-Complete. Inform. Process. Lett.\u00a012(3), 133\u2013137 (1981)","journal-title":"Inform. Process. Lett."},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-540-92182-0_7","volume-title":"Algorithms and Computation","author":"C. Gla\u00dfer","year":"2008","unstructured":"Gla\u00dfer, C., Reitwie\u00dfner, C., Schmitz, H.: Multiobjective Disk Cover Admits a PTAS. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 40\u201351. Springer, Heidelberg (2008)"},{"issue":"4","key":"13_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(91)90075-S","volume":"40","author":"T.F. Gonzalez","year":"1991","unstructured":"Gonzalez, T.F.: Covering a Set of Points in Multidimensional Space. Inform. Process. Lett.\u00a040(4), 181\u2013188 (1991)","journal-title":"Inform. Process. Lett."},{"key":"13_CR15","unstructured":"Har-Peled, S.: Being Fat and Friendly is Not Enough. arXiv:0908.2369v1 [cs.CG] (2009)"},{"key":"13_CR16","first-page":"46","volume-title":"Approximation Algorithms for NP-hard Problems","author":"D.S. Hochbaum","year":"1997","unstructured":"Hochbaum, D.S.: Approximating Covering and Packing Problems: Set Cover, Vertex Cover, Independent Set, and Related Problems. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-hard Problems, pp. 46\u201393. PWS Publishing Company, Boston (1997)"},{"issue":"1","key":"13_CR17","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. ACM\u00a032(1), 130\u2013136 (1985)","journal-title":"J. ACM"},{"key":"13_CR18","unstructured":"Hochbaum, D.S., Pathria, A.: Analysis of the greedy approach in covering problems (1994) (unpublished manuscript)"},{"issue":"2","key":"13_CR19","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10878-008-9146-0","volume":"18","author":"Y. Huang","year":"2009","unstructured":"Huang, Y., Gao, X., Zhang, Z., Wu, W.: A Better Constant-Factor Approximation for Weighted Dominating Set in Unit Disk Graph. J. Combin. Optim.\u00a018(2), 179\u2013194 (2009)","journal-title":"J. Combin. Optim."},{"issue":"3","key":"13_CR20","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. System Sci.\u00a09(3), 256\u2013278 (1974)","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"13_CR21","doi-asserted-by":"crossref","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(2), 182\u2013195 (1982)","journal-title":"J. Algorithms"},{"issue":"1","key":"13_CR22","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","volume":"70","author":"S. Khuller","year":"1999","unstructured":"Khuller, S., Moss, A., Naor, J.S.: The Budgeted Maximum Coverage Problem. Inform. Process. Lett.\u00a070(1), 39\u201345 (1999)","journal-title":"Inform. Process. Lett."},{"key":"13_CR23","unstructured":"Laue, S.: Geometric Set Cover and Hitting Sets for Polytopes in \u211d3. In: Albers, S., Weil, P. (eds.) Proc. STACS 2008, LIPIcs, vol. 1, pp. 479\u2013490. Schloss Dagstuhl \u2013 Leibniz-Zentrum fuer Informatik, Dagstuhl (2008)"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Liao, C., Hu, S.: Polynomial time approximation schemes for minimum disk cover problems. J. Global Optim. (2009), doi: 10.1007\/s10878-009-9216-y","DOI":"10.1007\/s10878-009-9216-y"},{"issue":"4","key":"13_CR25","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the ratio of optimal integral and fractional covers. Discrete Math.\u00a013(4), 383\u2013390 (1975)","journal-title":"Discrete Math."},{"key":"13_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/11847250_14","volume-title":"Parameterized and Exact Computation","author":"D. Marx","year":"2006","unstructured":"Marx, D.: Parameterized Complexity of Independence and Domination Problems on Geometric Graphs. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 154\u2013165. Springer, Heidelberg (2006)"},{"key":"13_CR27","first-page":"338","volume-title":"Proc. FOCS 2007","author":"D. Marx","year":"2007","unstructured":"Marx, D.: On the Optimality of Planar and Geometric Approximation Schemes. In: Proc. FOCS 2007, pp. 338\u2013348. IEEE, Los Alamitos (2007)"},{"key":"13_CR28","unstructured":"Mihal\u00e1k, M.: Optimization Problems in Communication Networks, PhD thesis, Univ. Leicester (2006)"},{"key":"13_CR29","first-page":"17","volume-title":"Proc. SoCG 2009","author":"N. Mustafa","year":"2009","unstructured":"Mustafa, N., Ray, S.: PTAS for Geometric Hitting Set Problems via Local Search. In: Proc. SoCG 2009, pp. 17\u201322. ACM, New York (2009)"},{"key":"13_CR30","unstructured":"Narayanappa, S., Vojt\u011bchovsk\u00fd, P.: An Improved Approximation Factor For The Unit Disk Covering Problem. In: Proc. CCCG 2006 (2006)"},{"key":"13_CR31","unstructured":"van Leeuwen, E.J.: Optimization and Approximation on Systems of Geometric Objects, PhD thesis, University of Amsterdam (2009)"},{"key":"13_CR32","first-page":"641","volume-title":"Proc. STOC 2010","author":"K. Varadarajan","year":"2010","unstructured":"Varadarajan, K.: Weighted Geometric Set Cover via Quasi-Uniform Sampling. In: Proc. STOC 2010, pp. 641\u2013648. ACM, New York (2010)"},{"issue":"2","key":"13_CR33","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0166-218X(93)90006-A","volume":"43","author":"R. Vohra","year":"1993","unstructured":"Vohra, R., Hall, N.G.: A Probabilistic Analysis of the Maximal Covering Location Problem. Discrete Appl. Math.\u00a043(2), 175\u2013183 (1993)","journal-title":"Discrete Appl. Math."},{"key":"13_CR34","doi-asserted-by":"crossref","unstructured":"Zou, F., Wang, Y., Xu, X.-H., Li, X., Du, H., Wan, P., Wu, W.: New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs. Theoret. Comput. Sci. (to appear)","DOI":"10.1016\/j.tcs.2009.06.022"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15369-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T22:49:57Z","timestamp":1552949397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15369-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153686","9783642153693"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15369-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}