{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T05:57:15Z","timestamp":1725429435599},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,8,6]],"date-time":"2011-08-06T00:00:00Z","timestamp":1312588800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s00224-011-9353-4","type":"journal-article","created":{"date-parts":[[2011,8,5]],"date-time":"2011-08-05T03:17:17Z","timestamp":1312514237000},"page":"545-558","source":"Crossref","is-referenced-by-count":6,"title":["An Improved Approximation Algorithm for the Most Points Covering Problem"],"prefix":"10.1007","volume":"50","author":[{"given":"Hossein","family":"Ghasemalizadeh","sequence":"first","affiliation":[]},{"given":"Mohammadreza","family":"Razzazi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,8,6]]},"reference":[{"key":"9353_CR1","doi-asserted-by":"crossref","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. 37, 43\u201358 (2007)","journal-title":"Discrete Comput. Geom."},{"key":"9353_CR2","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","volume":"3","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. Inf. Process. Lett. 3, 133\u2013137 (1981)","journal-title":"Inf. Process. Lett."},{"key":"9353_CR3","first-page":"277","volume-title":"Lecture Notes in Computer Science","author":"B. Fu","year":"2006","unstructured":"Fu,\u00a0B.: Theory and application of width bounded geometric separator. In: Lecture Notes in Computer Science, vol.\u00a03884, p.\u00a0277 (2006)"},{"key":"9353_CR4","first-page":"634","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige,\u00a0U.: A threshold of $\\ln n$ for approximating set cover. J.\u00a0ACM 45, 634\u2013652 (1998)","journal-title":"J.\u00a0ACM"},{"key":"9353_CR5","first-page":"130","volume":"32","author":"D.S. Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Maass,\u00a0W.: Approximation schemes for covering and packing problems in image processing and VLSI. J.\u00a0ACM 32, 130\u2013136 (1985)","journal-title":"J.\u00a0ACM"},{"key":"9353_CR6","doi-asserted-by":"crossref","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. Inf. Process. Lett. 40, 181\u2013188 (1991)","journal-title":"Inf. Process. Lett."},{"key":"9353_CR7","first-page":"317","volume-title":"Lecture Notes on Computer Science","author":"B. Fu","year":"2007","unstructured":"Fu,\u00a0B., Chen,\u00a0Z., Abdelguerfi,\u00a0M.: An almost linear time 2.8334-approximation algorithm for the disc covering problem. In: Lecture Notes on Computer Science, vol.\u00a04508, pp.\u00a0317\u2013329 (2007)"},{"key":"9353_CR8","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1109\/TC.2004.1268406","volume":"53","author":"M.F.M. Cook","year":"2004","unstructured":"Cook, M.F.M., Franceschetti,\u00a0M., Bruck,\u00a0J.: A geometric theorem for network design. IEEE Trans. Comput. 53, 483\u2013489 (2004)","journal-title":"IEEE Trans. Comput."},{"key":"9353_CR9","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.jalgor.2004.04.002","volume":"53","author":"R. Gandhi","year":"2004","unstructured":"Gandhi,\u00a0R., Khuller,\u00a0S., Srinivasan,\u00a0A.: Approximation algorithms for partial covering problems. J.\u00a0Algorithms 53, 55\u201384 (2004)","journal-title":"J.\u00a0Algorithms"},{"key":"9353_CR10","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","volume":"70","author":"S. Khuller","year":"1999","unstructured":"Khuller,\u00a0S., Moss,\u00a0A., Naor, J.S.: The budgeted maximum coverage problem. Inf. Process. Lett. 70, 39\u201345 (1999)","journal-title":"Inf. Process. Lett."},{"key":"9353_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02238188","volume":"36","author":"B.M. Chazelle","year":"1986","unstructured":"Chazelle, B.M., Lee, D.T.: On a circle placement problem. Computing 36, 1\u201316 (1986)","journal-title":"Computing"},{"key":"9353_CR12","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1007\/s00224-008-9135-9","volume":"45","author":"M.D. Berg","year":"2009","unstructured":"Berg, M.D., Cabello,\u00a0S., Har-Peled,\u00a0S.: Covering many or few points with unit disks. Theory Comput. Syst. 45, 446\u2013469 (2009)","journal-title":"Theory Comput. Syst."},{"key":"9353_CR13","doi-asserted-by":"crossref","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 33, 201\u2013226 (2002)","journal-title":"Algorithmica"},{"key":"9353_CR14","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.I., Stein,\u00a0C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9353-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-011-9353-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9353-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T07:54:23Z","timestamp":1558684463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-011-9353-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,6]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["9353"],"URL":"https:\/\/doi.org\/10.1007\/s00224-011-9353-4","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8,6]]}}}