{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:40Z","timestamp":1725663760372},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540545224"},{"type":"electronic","value":"9783540384366"}],"license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"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":[[1991]]},"DOI":"10.1007\/3-540-54522-0_130","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:59:16Z","timestamp":1330192756000},"page":"426-433","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Covering codes and combinatorial optimization"],"prefix":"10.1007","author":[{"given":"Patrick","family":"Sol\u00e9","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"40_CR1","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02592023","volume":"36","author":"F. Barahona","year":"1986","unstructured":"F. Barahona, A.R. Majhoub, \u201cOn the cut polytope\u201d, Math. Programming 36 (1986), pp. 157\u2013173.","journal-title":"Math. Programming"},{"key":"40_CR2","unstructured":"C. Berge, Graphes, Masson (1984)."},{"key":"40_CR3","unstructured":"C. Berge, Hypergraphes, Masson (1987)."},{"issue":"1","key":"40_CR4","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0097-3165(90)90011-K","volume":"54","author":"A.R. Calderbank","year":"1990","unstructured":"A.R. Calderbank, \u201cCovering Radius and the Chromatic Number of Kneser Graphs\u201d, J. of Comb. Th. A, 54, 1 (1990) 129\u2013131.","journal-title":"J. of Comb. Th. A"},{"key":"40_CR5","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J. Edmonds","year":"1973","unstructured":"J. Edmonds, E.L. Johnson, \u201cMatching, Euler Tours and the Chinese Postman\u201d, Math. Programming, 5 (1973), 88\u2013124.","journal-title":"Math. Programming"},{"key":"40_CR6","unstructured":"A. Frank, \u201cConservative weightings and ear-decomposition of graphs\u201d submitted to Combinatorica."},{"key":"40_CR7","first-page":"385","volume":"IT-31","author":"R.L. Graham","year":"1985","unstructured":"R.L. Graham, N.J.A. Sloane, \u201cOn the covering radius of codes\u201d, IEEE IT-31, pp. 385\u2013401 (1985).","journal-title":"IEEE"},{"key":"40_CR8","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0012-365X(89)90141-6","volume":"74","author":"P.C. Fishburn","year":"1989","unstructured":"P.C. Fishburn, N.J.A. Sloane, \u201cThe solution to Gale-Berlekamp 's switching game.\u201d Discr. Math. 74 (1989) 263\u2013290.","journal-title":"Discr. Math."},{"key":"40_CR9","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/0095-8956(89)90052-X","volume":"46","author":"M. Gr\u00f6tschel","year":"1989","unstructured":"M. Gr\u00f6tschel, K. Truemper, \u201cDecomposition and Optimization over cycles in Binary Matroids\u201d J. of Comb. Th. B 46, 306\u2013337 (1989).","journal-title":"J. of Comb. Th. B"},{"key":"40_CR10","doi-asserted-by":"crossref","unstructured":"F. Harary, Graph Theory, Addison-Wesley (1969).","DOI":"10.21236\/AD0705364"},{"key":"40_CR11","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1109\/18.42182","volume":"IT-35","author":"H. Janwa","year":"1989","unstructured":"H. Janwa, \u201cSome new upper bounds on the covering radius of binary linear codes\u201d, IEEE Trans. on Inf. Th., IT-35, 110\u2013122 (1989).","journal-title":"IEEE Trans. on Inf. Th."},{"key":"40_CR12","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lovasz","year":"1975","unstructured":"L. Lovasz, \u201cOn the ratio of optimal integral and fractionnal cover\u201d, Discr, Math., 13,pp. 383\u2013390 (1975).","journal-title":"Discr, Math."},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"A. McLoughlin, \u201cThe complexity of computing the covering radius of a code\u201d, IEEE Trans. on Inform. Th., IT-30, 6, Nov. 84.","DOI":"10.1109\/TIT.1984.1056978"},{"key":"40_CR14","unstructured":"J. Bruck, M. Naor, \u201cThe hardness of decoding linear codes with preprocessing\u201d, IBM Almaden Res. Report RJ 6504 (1988)."},{"key":"40_CR15","unstructured":"F.J. MacWilliams, N.J.A Sloane,The Theory of Error Correcting Codes,North-Holland (1981)."},{"issue":"6","key":"40_CR16","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1109\/TIT.1981.1056419","volume":"IT-27","author":"S.C. Ntafos","year":"1981","unstructured":"S.C. Ntafos, S.L. Hakimi, \u201cOn the complexity of some coding problems\u201d, IEEE Trans. on Inform. Th., IT-27, 6, (1981) 794\u2013796.","journal-title":"IEEE Trans. on Inform. Th."},{"key":"40_CR17","doi-asserted-by":"crossref","unstructured":"J. Pach, J. Spencer, \u201cExplicit codes with a low covering radius\u201d, IEEE Trans. on Inform. Th., IT-34, 5, Sept. 88.","DOI":"10.1109\/18.21258"},{"key":"40_CR18","unstructured":"A. Seb\u00f6, \u201cThe cographic multiflow problem: an epilogue\u201d, IMAG Res. Report 808-M, February (1990)."},{"key":"40_CR19","doi-asserted-by":"crossref","unstructured":"P.D. Seymour, \u201cThe matroids with the max-flow min-cut property\u201d, J. of Comb. Th. B, 189\u2013222 (1977).","DOI":"10.1016\/0095-8956(77)90031-4"},{"key":"40_CR20","doi-asserted-by":"crossref","unstructured":"P.D. Seymour, \u201cDecomposition of Regular Matroids\u201d, J. of Comb. Th. B, 28 305\u2013359(198).","DOI":"10.1016\/0095-8956(80)90075-1"},{"key":"40_CR21","doi-asserted-by":"crossref","unstructured":"P.D. Seymour, \u201cMatroids and Multicommodity Flows\u201d, European J. of Comb.2 (1981).","DOI":"10.1016\/S0195-6698(81)80033-9"},{"key":"40_CR22","unstructured":"P. Sol\u00e9, T. Zaslavsky, \u201cCovering radius and Maximality of the cycle code of a graph\u201d submitted to JCT B."},{"key":"40_CR23","unstructured":"P. Sol\u00e9, T. Zaslavsky, \u201cA coding approach to signed graphs\u201d. submitted to SIAM J. of Discr. Math."},{"key":"40_CR24","unstructured":"D. Welsh, Matroid Theory, Academic Press (1976)."}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54522-0_130","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:05:33Z","timestamp":1558253133000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54522-0_130"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540545224","9783540384366"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-54522-0_130","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]},"assertion":[{"value":"7 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}