{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:23:41Z","timestamp":1743042221895,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319259444"},{"type":"electronic","value":"9783319259451"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-25945-1_4","type":"book-chapter","created":{"date-parts":[[2015,11,6]],"date-time":"2015-11-06T22:20:37Z","timestamp":1446848437000},"page":"55-70","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Graph Methods for Generating Test Cases with Universal and Existential Constraints"],"prefix":"10.1007","author":[{"given":"Sylvain","family":"Hall\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edmond","family":"La Chance","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9bastien","family":"Gaboury","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,8]]},"reference":[{"key":"4_CR1","unstructured":"8th IEEE International Conference on Software Testing, Verification and Validation, ICST 2015, Graz, Austria, 13\u201317 April 2015. IEEE (2015). \n                      http:\/\/ieeexplore.ieee.org\/xpl\/mostRecentIssue.jsp?punumber=7102553"},{"issue":"4","key":"4_CR2","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D Br\u00e9laz","year":"1979","unstructured":"Br\u00e9laz, D.: New methods to color the vertices of a graph. Commun. ACM 22(4), 251\u2013256 (1979)","journal-title":"Commun. ACM"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Cheng, C.T., Dumitrescu, A., Schroeder, P.J.: Generating small combinatorial test suites to cover input-output relationships. In: QSIC. pp. 76\u201382. IEEE Computer Society (2003)","DOI":"10.1109\/QSIC.2003.1319088"},{"key":"4_CR4","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"issue":"5","key":"4_CR5","doi-asserted-by":"publisher","first-page":"1608","DOI":"10.1137\/S0097539700381097","volume":"31","author":"E Halperin","year":"2002","unstructured":"Halperin, E.: Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. SIAM J. Comput. 31(5), 1608\u20131623 (2002)","journal-title":"SIAM J. Comput."},{"key":"4_CR6","unstructured":"Hayhurst, K.J., Veerhusen, D.S., Chilenski, J.J., Rierson, L.K.: A practical tutorial on modified condition\/decision coverage. Technical report NASA\/TM-2001-210876, NASA (2001). \n                      http:\/\/shemesh.larc.nasa.gov\/fm\/papers\/Hayhurst-2001-tm210876-MCDC.pdf"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1007\/11523468_84","volume-title":"Automata, Languages and Programming","author":"G Karakostas","year":"2005","unstructured":"Karakostas, G.: A better approximation ratio for the vertex cover problem. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1043\u20131050. Springer, Heidelberg (2005)"},{"issue":"3","key":"4_CR8","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.jcss.2007.06.019","volume":"74","author":"S Khot","year":"2008","unstructured":"Khot, S., Regev, O.: Vertex cover might be hard to approximate to within \n                      \n                        \n                      \n                      $$2-\\epsilon $$\n                      \n                        \n                          \n                            2\n                            -\n                            \u03f5\n                          \n                        \n                      \n                    . J. Comput. Syst. Sci. 74(3), 335\u2013349 (2008)","journal-title":"J. Comput. Syst. Sci."},{"issue":"12","key":"4_CR9","first-page":"28","volume":"29","author":"J McCaffrey","year":"2009","unstructured":"McCaffrey, J.: Pairwise testing with QICT. MSDN Mag. 29(12), 28\u201335 (2009)","journal-title":"MSDN Mag."},{"issue":"3","key":"4_CR10","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1007\/s10623-013-9835-2","volume":"73","author":"S Raaphorst","year":"2014","unstructured":"Raaphorst, S., Moura, L., Stevens, B.: A construction for strength-3 covering arrays from linear feedback shift register sequences. Des. Codes Cryptogr. 73(3), 949\u2013968 (2014). \n                      http:\/\/dx.doi.org\/10.1007\/s10623-013-9835-2","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"4_CR11","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/32.979992","volume":"28","author":"K Tai","year":"2002","unstructured":"Tai, K., Lei, Y.: A test generation strategy for pairwise testing. IEEE Trans. Softw. Eng. 28(1), 109\u2013111 (2002). \n                      http:\/\/doi.ieeecomputersociety.org\/10.1109\/32.979992","journal-title":"IEEE Trans. Softw. Eng."},{"key":"4_CR12","unstructured":"Vilkomir, S., Anderson, D.: Improving IPOG\u2019s vertical growth based on a graph coloring scheme. In: 8th IEEE International Conference on Software Testing, Verification and Validation Workshops, ICSTW 2015, Graz, Austria, 13\u201317 April 2015, pp. 1\u20138 (2015) [1]. \n                      http:\/\/ieeexplore.ieee.org\/xpl\/mostRecentIssue.jsp?punumber=7102553"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Vilkomir, S., Anderson, D.: Relationship between pair-wise and MC\/DC testing: initial experimental results. In: 8th IEEE International Conference on Software Testing, Verification and Validation Workshops, ICSTW 2015, Graz, Austria, 13\u201317 April 2015 [1]. \n                      http:\/\/ieeexplore.ieee.org\/xpl\/mostRecentIssue.jsp?punumber=7102553","DOI":"10.1109\/ICSTW.2015.7107439"}],"container-title":["Lecture Notes in Computer Science","Testing Software and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25945-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,18]],"date-time":"2019-12-18T03:24:20Z","timestamp":1576639460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25945-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319259444","9783319259451"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25945-1_4","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":"8 November 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}