{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:13:16Z","timestamp":1742976796955,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319181721"},{"type":"electronic","value":"9783319181738"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18173-8_13","type":"book-chapter","created":{"date-parts":[[2015,5,15]],"date-time":"2015-05-15T08:47:43Z","timestamp":1431679663000},"page":"182-193","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Randomized Adaptive Test Cover"],"prefix":"10.1007","author":[{"given":"Peter","family":"Damaschke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,16]]},"reference":[{"key":"13_CR1","unstructured":"Basavaraju, M., Francis, M.C., Ramanujan, M.S., Saurabh, S.: Partially Polynomial Kernels for Set Cover and Test Cover. In: Seth, A., Vishnoi, N.K. (Eds.) FSTTCS 2013. LIPIcs, vol. 24, pp. 67\u201378. Dagstuhl (2013)"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/s10107-003-0414-6","volume":"98","author":"KMJ de Bontridder","year":"2003","unstructured":"de Bontridder, K.M.J., Halld\u00f3rsson, B.V., Halld\u00f3rsson, M.M., Hurkens, C.A.J., Lenstra, J.K., Ravi, R., Stougie, L.: Approximation Algorithms for the Test Cover Problem. Math. Progr. Series B 98, 477\u2013491 (2003)","journal-title":"Math. Progr. Series B"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-45749-6_23","volume-title":"Algorithms - ESA 2002","author":"KMJ De Bontridder","year":"2002","unstructured":"De Bontridder, K.M.J., Lageweg, B.J., Lenstra, J.K., Orlin, J.B., Stougie, L.: Branch-and-bound algorithms for the test cover problem. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 223\u2013233. Springer, Heidelberg (2002)"},{"key":"13_CR4","unstructured":"Crowston, R., Gutin, G., Jones, M., Muciaccia, G., Yeo, A.: Parameterizations of Test Cover with Bounded Test Sizes. CoRR abs\/1209.6528 (2012)"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-642-32589-2_27","volume-title":"Mathematical Foundations of Computer Science 2012","author":"R Crowston","year":"2012","unstructured":"Crowston, R., Gutin, G., Jones, M., Saurabh, S., Yeo, A.: Parameterized study of the test cover problem. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 283\u2013295. Springer, Heidelberg (2012)"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-540-74450-4_3","volume-title":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","author":"P Cui","year":"2007","unstructured":"Cui, P.: A tighter analysis of set cover greedy algorithm for test set. In: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol. 4614, pp. 24\u201335. Springer, Heidelberg (2007)"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Du, D.Z., Hwang, F.K.: Combinatorial Group Testing and Its Applications. Series on Appl. Math. vol. 3. World Scientific (2000)","DOI":"10.1142\/4252"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Fahle, T., Tiemann, K.: A Faster Branch-and-Bound Algorithm for the Test-Cover Problem Based on Set-Covering Techniques. ACM J. Experim. Algor. 11 (2006)","DOI":"10.1145\/1187436.1216579"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-540-85097-7_6","volume-title":"Combinatorial Optimization and Applications","author":"H Fernau","year":"2008","unstructured":"Fernau, H., Raible, D.: A parameterized perspective on packing paths of length two. In: Yang, B., Du, D.-Z., Wang, C.A. (eds.) COCOA 2008. LNCS, vol. 5165, pp. 54\u201363. Springer, Heidelberg (2008)"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.ipl.2012.12.008","volume":"113","author":"G Gutin","year":"2013","unstructured":"Gutin, G., Muciaccia, G., Yeo, A.: (Non-)existence of Polynomial Kernels for the Test Cover Problem. Info. Proc. Letters 113, 123\u2013126 (2013)","journal-title":"Info. Proc. Letters"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0377-2217(02)00071-1","volume":"140","author":"DS Hochbaum","year":"2002","unstructured":"Hochbaum, D.S.: Solving Integer Programs over Monotone Inequalities in Three Variables: A Framework for Half Integrality and Good Approximations. Eur. J. Operational Res. 140, 291\u2013321 (2002)","journal-title":"Eur. J. Operational Res."},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s00453-013-9750-y","volume":"67","author":"G Wiener","year":"2013","unstructured":"Wiener, G.: Rounds in Combinatorial Search. Algorithmica 67, 315\u2013323 (2013)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18173-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,10]],"date-time":"2023-08-10T15:24:47Z","timestamp":1691681087000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18173-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181721","9783319181738"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18173-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}