{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:35:50Z","timestamp":1725536150106},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033506"},{"type":"electronic","value":"9783642033513"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03351-3_29","type":"book-chapter","created":{"date-parts":[[2009,8,3]],"date-time":"2009-08-03T08:53:58Z","timestamp":1249289638000},"page":"310-321","source":"Crossref","is-referenced-by-count":3,"title":["The Budgeted Unique Coverage Problem and Color-Coding"],"prefix":"10.1007","author":[{"given":"Neeldhara","family":"Misra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Somnath","family":"Sikdar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"29_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.jcta.2003.08.001","volume":"104","author":"N. Alon","year":"2003","unstructured":"Alon, N., Cohen, G., Krivelevich, M., Litsyn, S.: Generalized hashing and parent-identifying codes. Journal of Combinatorial Theory Series A\u00a0104(1), 207\u2013215 (2003)","journal-title":"Journal of Combinatorial Theory Series A"},{"issue":"4","key":"29_CR2","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N. Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM\u00a042(4), 844\u2013856 (1995)","journal-title":"J. ACM"},{"issue":"3","key":"29_CR3","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1137\/S0895480100376848","volume":"14","author":"A. Barg","year":"2001","unstructured":"Barg, A., Cohen, G., Encheva, S., Kabatiansky, G., Z\u00e9mor, G.: A hypergraph approach to the identifying parent property: The case of multiple parents. SIAM Journal of Discrete Mathematics\u00a014(3), 423\u2013431 (2001)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"29_CR4","unstructured":"Chen, J., Lu, S., Sze, S.-H., Zhang, F.: Improved algorithms for path, matching, and packing problems. In: SODA, pp. 298\u2013307 (2007)"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Hajiaghayi, M.T., Feige, U., Salavatipour, M.R.: Combination can be hard: approximability of the unique coverage problem. In: SODA, pp. 162\u2013171 (2006)","DOI":"10.1145\/1109557.1109577"},{"key":"29_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer, New York (1999)"},{"key":"29_CR7","unstructured":"Erlebach, T., van Leeuwen, E.J.: Approximating geometric coverage problems. In: SODA, pp. 1267\u20131276 (2008)"},{"key":"29_CR8","series-title":"Texts in Theoretical Computer Science. An EATCS Series","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2006)"},{"key":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/11538462_9","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"V. Guruswami","year":"2005","unstructured":"Guruswami, V., Trevisan, L.: The complexity of making unique choices: Approximating 1-in-k sat. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX 2005 and RANDOM 2005. LNCS, vol.\u00a03624, pp. 99\u2013110. Springer, Heidelberg (2005)"},{"issue":"1","key":"29_CR10","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.: The budgeted maximum coverage problem. Inf. Process. Lett.\u00a070(1), 39\u201345 (1999)","journal-title":"Inf. Process. Lett."},{"key":"29_CR11","first-page":"170","volume-title":"Proceedings of the 23th IEEE Symposium on Foundations of Computer Science (FOCS)","author":"K. Mehlhorn","year":"1982","unstructured":"Mehlhorn, K.: On the program size of perfect and universal hash functions. In: Proceedings of the 23th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 170\u2013175. IEEE, Los Alamitos (1982)"},{"key":"29_CR12","unstructured":"Moser, H., Misra, N., Raman, V., Saurabh, S., Sikdar, S.: The parameterized complexity of the Unique Coverage problem (2009) (manuscript)"},{"key":"29_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/978-3-540-77120-3_54","volume-title":"Algorithms and Computation","author":"H. Moser","year":"2007","unstructured":"Moser, H., Raman, V., Sikdar, S.: The parameterized complexity of the unique coverage problem. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol.\u00a04835, pp. 621\u2013631. Springer, Heidelberg (2007)"},{"key":"29_CR14","series-title":"Oxford Lecture Series in Mathematics and its Applications","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to fixed-parameter algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford Lecture Series in Mathematics and its Applications, vol.\u00a031. Oxford University Press, Oxford (2006)"},{"issue":"5","key":"29_CR15","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1137\/0219054","volume":"19","author":"J.P. Schmidt","year":"1990","unstructured":"Schmidt, J.P., Siegel, A.: The spatial complexity of oblivious k-probe hash functions. SIAM J. Computing\u00a019(5), 775\u2013786 (1990)","journal-title":"SIAM J. Computing"}],"container-title":["Lecture Notes in Computer Science","Computer Science - Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03351-3_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T03:13:21Z","timestamp":1552101201000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03351-3_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033506","9783642033513"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03351-3_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}