{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T05:17:01Z","timestamp":1725686221833},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540695134"},{"type":"electronic","value":"9783540695141"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/11970125_5","type":"book-chapter","created":{"date-parts":[[2007,1,24]],"date-time":"2007-01-24T05:47:40Z","timestamp":1169617660000},"page":"55-68","source":"Crossref","is-referenced-by-count":1,"title":["Covering Many or Few Points with Unit Disks"],"prefix":"10.1007","author":[{"given":"Mark","family":"de Berg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Cabello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sariel","family":"Har-Peled","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/3-540-45749-6_8","volume-title":"Algorithms - ESA 2002","author":"P.K. Agarwal","year":"2002","unstructured":"Agarwal, P.K., Hagerup, T., Ray, R., Sharir, M., Smid, M., Welzl, E.: Translating a planar object to maximize point containment. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, p. 42. Springer, Heidelberg (2002)"},{"key":"5_CR2","unstructured":"Aronov, B., Har-Peled, S.: On approximating the depth and related problems. In: SODA 2005, pp. 886\u2013894 (2005)"},{"key":"5_CR3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0925-7721(02)00128-1","volume":"25","author":"P. Bose","year":"2003","unstructured":"Bose, P., van Kreveld, M., Maheshwari, A., Morin, P., Morrison, J.: Translating a regular grid over a point set. Comput. Geom. Theory Appl.\u00a025, 21\u201334 (2003)","journal-title":"Comput. Geom. Theory Appl."},{"key":"#cr-split#-5_CR4.1","unstructured":"Cabello, S., D??az B????ez, J.M., Seara, C., Sellar??s, J.A., Urrutia, J., Ventura, I.: Covering point sets with two disjoint disks or squares. Manuscript available at??                                      http:\/\/www.fmf.uni-lj.si\/~cabello\/publications\/;"},{"key":"#cr-split#-5_CR4.2","unstructured":"Preliminary version appeared at EWCG 2005"},{"key":"5_CR5","volume-title":"The Discrepancy Method: Randomness and Complexity","author":"B. Chazelle","year":"2001","unstructured":"Chazelle, B.: The Discrepancy Method: Randomness and Complexity. Cambridge University Press, New York (2001)"},{"key":"5_CR6","first-page":"983","volume-title":"Handbook of Discrete and Computational Geometry","author":"B. Chazelle","year":"2004","unstructured":"Chazelle, B.: The discrepancy method in computational geometry. In: Handbook of Discrete and Computational Geometry, pp. 983\u2013996. CRC Press, Boca Raton (2004)"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02238188","volume":"36","author":"B. Chazelle","year":"1986","unstructured":"Chazelle, B., Lee, D.T.: On a circle placement problem. Computing\u00a036, 1\u201316 (1986)","journal-title":"Computing"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/BF02187740","volume":"4","author":"K.L. Clarkson","year":"1989","unstructured":"Clarkson, K.L., Shor, P.W.: Applications of random sampling in computational geometry, II. Discrete Comput. Geom.\u00a04, 387\u2013421 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"5_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 2nd edn. Springer, Berlin (2000)","edition":"2"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1287\/mnsc.27.7.848","volume":"27","author":"Z. Drezner","year":"1991","unstructured":"Drezner, Z.: On a modified one-center model. Management Science\u00a027, 848\u2013851 (1991)","journal-title":"Management Science"},{"key":"5_CR11","first-page":"83","volume":"2","author":"Z. Drezner","year":"1994","unstructured":"Drezner, Z., Wesolowsky, G.O.: Finding the circle or rectangle containing the minimum weight of points. Location Science\u00a02, 83\u201390 (1994)","journal-title":"Location Science"},{"key":"5_CR12","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0925-7721(95)00022-2","volume":"5","author":"A. Gajentaan","year":"1995","unstructured":"Gajentaan, A., Overmars, M.H.: On a class of O(n\n                        2) problems in computational geometry. Comput. Geom. Theory Appl.\u00a05, 165\u2013185 (1995)","journal-title":"Comput. Geom. Theory Appl."},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"1859","DOI":"10.1016\/S0305-0548(01)00063-6","volume":"29","author":"M.J. Katz","year":"2002","unstructured":"Katz, M.J., Kedem, K., Segal, M.: Improved algorithms for placing undesirable facilities. Computers and Operations Research\u00a029, 1859\u20131872 (2002)","journal-title":"Computers and Operations Research"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"1384","DOI":"10.1137\/S0097539794268649","volume":"26","author":"M.J. Katz","year":"1997","unstructured":"Katz, M.J., Sharir, M.: An expander-based approach to geometric optimization. SIAM J. Computing\u00a026, 1384\u20131408 (1997)","journal-title":"SIAM J. Computing"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1006\/jcss.1995.1018","volume":"50","author":"J. Matou\u0161ek","year":"1995","unstructured":"Matou\u0161ek, J.: Approximations and optimal geometric divide-an-conquer. J. Comput. Syst. Sci.\u00a050, 203\u2013208 (1995)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR16","first-page":"39","volume-title":"Location Analysis: Theory and Applications, ch. 2","author":"F. Plastria","year":"2001","unstructured":"Plastria, F.: Continuous covering location problems. In: Hamacher, H., Drezner, Z. (eds.) Location Analysis: Theory and Applications, ch. 2, pp. 39\u201383. Springer, Heidelberg (2001)"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/BF02574706","volume":"6","author":"M. Sharir","year":"1991","unstructured":"Sharir, M.: On k-sets in arrangements of curves and surfaces. Discrete Comput. Geom.\u00a06, 593\u2013613 (1991)","journal-title":"Discrete Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11970125_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T20:28:37Z","timestamp":1553372917000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11970125_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540695134","9783540695141"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11970125_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}