{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:07:51Z","timestamp":1725552471519},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121999"},{"type":"electronic","value":"9783642122002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12200-2_32","type":"book-chapter","created":{"date-parts":[[2010,4,21]],"date-time":"2010-04-21T09:53:05Z","timestamp":1271843585000},"page":"356-371","source":"Crossref","is-referenced-by-count":3,"title":["Finding the Best CAFE Is NP-Hard"],"prefix":"10.1007","author":[{"given":"Elizabeth","family":"Maltais","sequence":"first","affiliation":[]},{"given":"Lucia","family":"Moura","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0012-365X(83)90054-7","volume":"44","author":"R. Brigham","year":"1983","unstructured":"Brigham, R., Dutton, R.: On clique covers and independence numbers of graphs. Discrete Math.\u00a044, 139\u2013144 (1983)","journal-title":"Discrete Math."},{"key":"32_CR2","unstructured":"Burr, K., Young, W.: Combinatorial test techniques: table-based automation, test generation and code coverage. In: Proc. of the Intl. Conf. on Software Testing Analysis and Review, pp. 503\u2013513 (1998)"},{"key":"32_CR3","unstructured":"Cawse, J.: Experimental design for combinatorial and high throughput materials development. GE Global Research Technical Report 29, pp. 769\u2013781 (2002)"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Cohen, M., Dwyer, M., Shi, J.: Interaction testing of highly-configurable systems in the presence of constraints. In: International Symposium on Software Testing and Analysis (ISSTA), London, pp. 129\u2013139 (2007)","DOI":"10.1145\/1273463.1273482"},{"key":"32_CR5","first-page":"121","volume":"58","author":"C. Colbourn","year":"2004","unstructured":"Colbourn, C.: Combinatorial aspects of covering arrays. Le Matematiche, Catania\u00a058, 121\u2013167 (2004)","journal-title":"Le Matematiche, Catania"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Colbourn, C., Dinitz, J.: Handbook of Combinatorial Designs, Second Edition. Chapman and Hall\/CRC (2007)","DOI":"10.1201\/9781420010541"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Dalal, S., Jain, A., Karunanithi, N., Leaton, J., Lott, C., Patton, G., Horowitz, B.: Model-based testing in practice. In: Proc. of the Intl. Conf. on Software Engineering (ICSE 1999), New York, pp. 285\u2013294 (1999)","DOI":"10.1145\/302405.302640"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"5403","DOI":"10.1016\/j.tcs.2009.07.057","volume":"410","author":"P. Danziger","year":"2009","unstructured":"Danziger, P., Mendelsohn, E., Moura, L., Stevens, B.: Covering arrays avoiding forbidden edges. Theor. Comput. Sci.\u00a0410, 5403\u20135414 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"32_CR9","doi-asserted-by":"crossref","first-page":"106","DOI":"10.4153\/CJM-1966-014-3","volume":"18","author":"P. Erd\u00f6s","year":"1966","unstructured":"Erd\u00f6s, P., Goodman, A., P\u00f3sa, L.: The representation of a graph by set intersections. Can. J. Math.\u00a018, 106\u2013112 (1966)","journal-title":"Can. J. Math."},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0012-365X(90)90168-H","volume":"85","author":"A. Gy\u00e1rf\u00e1s","year":"1990","unstructured":"Gy\u00e1rf\u00e1s, A.: A simple lower bound on edge coverings by cliques. Discrete Math.\u00a085, 103\u2013104 (1990)","journal-title":"Discrete Math."},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.disc.2003.11.029","volume":"284","author":"A. Hartman","year":"2004","unstructured":"Hartman, A., Raskin, L.: Problems and algorithms for covering arrays. Discrete Math.\u00a0284, 149\u2013156 (2004)","journal-title":"Discrete Math."},{"issue":"2","key":"32_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/359340.359346","volume":"21","author":"L. Kou","year":"1978","unstructured":"Kou, L., Stockmeyer, L., Wong, C.: Covering edges by cliques with regard to keyword conflicts and intersection graphs. Commun. ACM\u00a021(2), 135\u2013139 (1978)","journal-title":"Commun. ACM"},{"key":"32_CR13","unstructured":"Kuhn, D., Reilly, M.: An investigation into the applicability of design of experiments to software testing. In: Proc. 27 th Annual NASA\/IEEE Software Engineering Workshop, NASA Goddard Space Flight Center, pp. 91\u201395 (2002)"},{"issue":"6","key":"32_CR14","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1109\/TSE.2004.24","volume":"30","author":"R. Kuhn","year":"2004","unstructured":"Kuhn, R., Wallace, D., Gallo, A.: Software fault interactions and implications for software testing. IEEE T. Software Eng.\u00a030(6), 418\u2013421 (2004)","journal-title":"IEEE T. Software Eng."},{"key":"32_CR15","first-page":"231","volume-title":"Theory of Graphs (Proc. Colloq., Tihany, 1966)","author":"L. Lov\u00e1sz","year":"1968","unstructured":"Lov\u00e1sz, L.: On covering of graphs. In: Theory of Graphs (Proc. Colloq., Tihany, 1966), pp. 231\u2013236. Academic Press, New York (1968)"},{"issue":"5","key":"32_CR16","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C. Lund","year":"1994","unstructured":"Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. J. Assoc. Comput. Mach.\u00a041(5), 960\u2013981 (1994)","journal-title":"J. Assoc. Comput. Mach."},{"key":"32_CR17","unstructured":"Maltais, E.: Covering arrays avoiding forbidden edges and edge clique covers. MSc thesis, University of Ottawa (2009)"},{"key":"32_CR18","doi-asserted-by":"publisher","first-page":"1776","DOI":"10.1137\/080730706","volume":"23","author":"C. Martinez","year":"2009","unstructured":"Martinez, C., Moura, L., Panario, D., Stevens, B.: Locating errors using ELAs, covering arrays, and adaptive testing algorithms. SIAM J. Discrete Math.\u00a023, 1776\u20131799 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"32_CR19","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1002\/jcd.10059","volume":"11","author":"L. Moura","year":"2003","unstructured":"Moura, L., Stardom, J., Stevens, B., Williams, A.: Covering arrays with mixed alphabet sizes. J. Comb. Des.\u00a011, 413\u2013432 (2003)","journal-title":"J. Comb. Des."},{"issue":"5","key":"32_CR20","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/1385-7258(77)90055-5","volume":"80","author":"J. Orlin","year":"1977","unstructured":"Orlin, J.: Contentment in graph theory: covering graphs with cliques. Nederl. Akad. Wetensch. Proc. Ser. A\u00a080(5), 406\u2013424 (1977)","journal-title":"Nederl. Akad. Wetensch. Proc. Ser. A"},{"key":"32_CR21","doi-asserted-by":"crossref","unstructured":"Williams, A., Probert, R.: A measure for component interaction test coverage. In: Proc. ACS\/IEEE International Conference on Computer Systems and Applications, pp. 301\u2013311 (2001)","DOI":"10.1109\/AICCSA.2001.934001"}],"container-title":["Lecture Notes in Computer Science","LATIN 2010: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12200-2_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:51:16Z","timestamp":1606168276000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12200-2_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121999","9783642122002"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12200-2_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}