{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:59:53Z","timestamp":1725487193001},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441809"},{"type":"electronic","value":"9783540457497"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45749-6_58","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T11:42:44Z","timestamp":1183549364000},"page":"662-674","source":"Crossref","is-referenced-by-count":1,"title":["Covering Things with Things"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Langerman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pat","family":"Morin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,29]]},"reference":[{"key":"58_CR1","unstructured":"P.K. Agarwal and C. M. Procopiuc. Exact and approximation algorithms for clustering. In Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms (SODA 1998), pages 658\u2013667, 1998."},{"key":"58_CR2","unstructured":"George E. Andrews. The Theory of Partitions. Addison-Wesley, 1976."},{"key":"58_CR3","unstructured":"B. Brod\u00e9n, M. Hammar, and B. J. Nilsson. Guarding lines and 2-link polygons is APX-hard. In Proceedings of the 13th Canadian Conference on Computational Geometry, pages 45\u201348, 2001."},{"key":"58_CR4","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1006\/jagm.2001.1186","volume":"41","author":"J. Chen","year":"2001","unstructured":"J. Chen, I. Kanj, and W. Jia. Vertex cover: further observations and further improvements. Journal of Algorithms, 41:280\u2013301, 2001.","journal-title":"Journal of Algorithms"},{"key":"58_CR5","doi-asserted-by":"crossref","unstructured":"R.G. Downey and M.R. Fellows. Parameterized Complexity. Springer, 1999.","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"58_CR6","unstructured":"Leonhardo Eulero. Introductio in Analysin Infinitorum. Tomus Primus, Lausanne, 1748."},{"key":"58_CR7","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0925-7721(95)00020-8","volume":"6","author":"L. J. Guibas","year":"1996","unstructured":"L. J. Guibas, M. H. Overmars, and J.-M. Robert. The exact fitting problem for points. Computational Geometry: Theory and Applications, 6:215\u2013230, 1996.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"58_CR8","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0166-218X(91)90011-K","volume":"30","author":"R. Hassin","year":"1991","unstructured":"R. Hassin and N. Megiddo. Approximation algorithms for hitting objects by straight lines. Discrete Applied Mathematics, 30:29\u201342, 1991.","journal-title":"Discrete Applied Mathematics"},{"key":"58_CR9","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D. S. Johnson","year":"1974","unstructured":"D. S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer Systems Sciences, 9:256\u2013278, 1974.","journal-title":"Journal of Computer Systems Sciences"},{"key":"58_CR10","doi-asserted-by":"crossref","unstructured":"R. M. Karp. Reducibility Among Combinatorial Problems, pages 85\u2013103. Plenum Press, 1972.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"58_CR11","doi-asserted-by":"crossref","unstructured":"V. S. A. Kumar, S. Arya, and H. Ramesh. Hardness of set cover with intersection 1. In Proceedings of the 27th International Colloquium on Automata, Languages and Programming, pages 624\u2013635, 2000.","DOI":"10.1007\/3-540-45022-X_53"},{"key":"58_CR12","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0167-6377(82)90039-6","volume":"1","author":"N. Megiddo","year":"1982","unstructured":"N. Megiddo and A. Tamir. On the complexity of locating linear facilities in the plane. Operations Research Letters, 1:194\u2013197, 1982.","journal-title":"Operations Research Letters"},{"key":"58_CR13","doi-asserted-by":"crossref","unstructured":"D. Nussbaum. Rectilinear p-piercing problems. In ISSAC\u2019 97. Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, July 21\u201323, 1997, Maui, Hawaii, pages 316\u2013323, 1997.","DOI":"10.1145\/258726.258828"},{"key":"58_CR14","doi-asserted-by":"crossref","unstructured":"Franco P. Preparata and Michael Ian Shamos. Computational Geometry: An Introduction. Springer-Verlag, 1985.","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"58_CR15","doi-asserted-by":"crossref","unstructured":"M. Sharir and E. Welzl. Rectilinear and polygonal p-piercing and p-center problems. In Proceedings of the Twelfth Annual Symposium On Computational Geometry (ISG\u2019 96), pages 122\u2013132, 1996.","DOI":"10.1145\/237218.237255"},{"key":"58_CR16","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"V. N. Vapnik","year":"1971","unstructured":"V. N. Vapnik and A. Y. A. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, 16:264\u2013280, 1971.","journal-title":"Theory of Probability and its Applications"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45749-6_58","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T23:06:40Z","timestamp":1556579200000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45749-6_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441809","9783540457497"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45749-6_58","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}