{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:21:09Z","timestamp":1759638069318},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213972"},{"type":"electronic","value":"9783319213989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21398-9_43","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T11:12:41Z","timestamp":1435057961000},"page":"548-558","source":"Crossref","is-referenced-by-count":9,"title":["Unique Covering Problems with Geometric Sets"],"prefix":"10.1007","author":[{"given":"Pradeesha","family":"Ashok","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sudeshna","family":"Kolay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neeldhara","family":"Misra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"issue":"4","key":"43_CR1","doi-asserted-by":"publisher","first-page":"1464","DOI":"10.1137\/060656048","volume":"38","author":"ED Demaine","year":"2008","unstructured":"Demaine, E.D., Feige, U., Hajiaghayi, M., Salavatipour, M.R.: Combination Can Be Hard: Approximability of the Unique Coverage Problem. SIAM J. Comput. () 38(4), 1464\u20131483 (2008)","journal-title":"SIAM J. Comput. ()"},{"issue":"2","key":"43_CR2","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.1145\/2650261","volume":"11","author":"M Dom","year":"2014","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S.: Kernelization Lower Bounds Through Colors and IDs. ACM Trans. Algorithms 11(2), 13:1\u201313:20 (2014). doi:\n                      10.1145\/2650261","journal-title":"ACM Trans. Algorithms"},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity, p. 530. Springer-Verlag (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"43_CR4","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series). Springer-Verlag New York Inc (2006)"},{"issue":"3","key":"43_CR5","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0196-6774(87)90012-5","volume":"8","author":"DS Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Maass, W.: Fast approximation algorithms for a nonconvex covering problem. Journal of algorithms 8(3), 305\u2013323 (1987)","journal-title":"Journal of algorithms"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility Among Combinatorial Problems. Complexity of Computer Computations, pp. 85\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"4","key":"43_CR7","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s00454-004-1108-4","volume":"33","author":"S Langerman","year":"2005","unstructured":"Langerman, S., Morin, P.: Covering things with things. Discrete & Computational Geometry 33(4), 717\u2013729 (2005)","journal-title":"Discrete & Computational Geometry"},{"key":"43_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/11561071_41","volume-title":"Algorithms \u2013 ESA 2005","author":"D\u00e1niel Marx","year":"2005","unstructured":"Marx, D\u00e1niel: Efficient approximation schemes for geometric problems? In: Brodal, Gerth St\u00f8lting, Leonardi, Stefano (eds.) ESA 2005. LNCS, vol. 3669, pp. 448\u2013459. Springer, Heidelberg (2005)"},{"key":"43_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on discrete geometry","author":"J Matou\u0161ek","year":"2002","unstructured":"Matou\u0161ek, J.: Lectures on discrete geometry, vol. 108. Springer, New York (2002)"},{"issue":"5","key":"43_CR10","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0167-6377(82)90039-6","volume":"1","author":"N Megiddo","year":"1982","unstructured":"Megiddo, N., Tamir, A.: On the Complexity of Locating Linear Facilities in the Plane. Oper. Res. Lett. 1(5), 194\u2013197 (1982). doi:\n                      10.1016\/0167-6377(82)90039-6","journal-title":"Oper. Res. Lett."},{"key":"43_CR11","doi-asserted-by":"crossref","unstructured":"Misra, N., Moser, H., Raman, V., Saurabh, S., Sikdar, S.: The Parameterized Complexity of Unique Coverage and Its Variants. Algorithmica, 517\u2013544 (2013)","DOI":"10.1007\/s00453-011-9608-0"},{"key":"43_CR12","doi-asserted-by":"crossref","unstructured":"Mustafa, N., Ray, S.: PTAS for geometric hitting set problems via local search. In: Proceedings of the 25th annual symposium on Computational geometry, pp. 17\u201322. ACM (2009)","DOI":"10.1145\/1542362.1542367"},{"issue":"2","key":"43_CR13","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"VN Vapnik","year":"1971","unstructured":"Vapnik, V.N., Chervonenkis, A.Y.: On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability & Its Applications 16(2), 264\u2013280 (1971)","journal-title":"Theory of Probability & Its Applications"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21398-9_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T04:18:50Z","timestamp":1559189930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-21398-9_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213972","9783319213989"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21398-9_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}