{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T11:13:22Z","timestamp":1764587602619},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642366932"},{"type":"electronic","value":"9783642366949"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36694-9_8","type":"book-chapter","created":{"date-parts":[[2013,3,11]],"date-time":"2013-03-11T06:08:39Z","timestamp":1362982119000},"page":"86-97","source":"Crossref","is-referenced-by-count":3,"title":["Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property"],"prefix":"10.1007","author":[{"given":"Flavia","family":"Bonomo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianpaolo","family":"Oriolo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudia","family":"Snels","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gautier","family":"Stauffer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"8_CR1","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B. Aspvall","year":"1979","unstructured":"Aspvall, B., Plass, M., Tarjan, R.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inf. Process. Lett.\u00a08(3), 121\u2013123 (1979)","journal-title":"Inf. Process. Lett."},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/978-3-540-78163-9_6","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"R. Bagnara","year":"2008","unstructured":"Bagnara, R., Hill, P.M., Zaffanella, E.: An Improved Tight Closure Algorithm for Integer Octagonal Constraints. In: Logozzo, F., Peled, D.A., Zuck, L.D. (eds.) VMCAI 2008. LNCS, vol.\u00a04905, pp. 8\u201321. Springer, Heidelberg (2008)"},{"key":"8_CR3","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1973","unstructured":"Berge, C.: Graphs and Hypergraphs. Dunod, Paris (1973)"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-642-34611-8_6","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"F. Bonomo","year":"2012","unstructured":"Bonomo, F., Oriolo, G., Snels, C.: Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs. In: Golumbic, M.C., Stern, M., Levy, A., Morgenstern, G. (eds.) WG 2012. LNCS, vol.\u00a07551, pp. 22\u201333. Springer, Heidelberg (2012)"},{"issue":"2","key":"8_CR5","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","volume":"18","author":"V. Chv\u00e1tal","year":"1975","unstructured":"Chv\u00e1tal, V.: On certain polytopes associated with graphs. J. Combin. Theory, Ser. B\u00a018(2), 138\u2013154 (1975)","journal-title":"J. Combin. Theory, Ser. B"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/0095-8956(88)90085-8","volume":"44","author":"V. Chv\u00e1tal","year":"1988","unstructured":"Chv\u00e1tal, V., Sbihi, N.: Recognizing claw-free perfect graphs. J. Combin. Theory, Ser. B\u00a044, 154\u2013176 (1988)","journal-title":"J. Combin. Theory, Ser. B"},{"key":"8_CR7","first-page":"89","volume-title":"Combinatorial Structures and Their Applications","author":"J. Edmonds","year":"1970","unstructured":"Edmonds, J., Johnson, E.: Matching: a well-solved class of integer linear programs. In: Guy, R., Hanani, H., Sauer, N., Sch\u00f6nheim, J. (eds.) Combinatorial Structures and Their Applications, pp. 89\u201392. Gordon and Breach, New York (1970)"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J. Edmonds","year":"1973","unstructured":"Edmonds, J., Johnson, E.: Matching, Euler tours and the Chinese postman. Math. Program.\u00a05, 88\u2013124 (1973)","journal-title":"Math. Program."},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Faenza, Y., Oriolo, G., Stauffer, G.: An algorithmic decomposition of claw-free graphs leading to an O(n\n                3)-algorithm for the weighted stable set problem. In: Randall, D. (ed.) Proc. 22nd SODA, San Francisco, CA, pp. 630\u2013646 (2011)","DOI":"10.1137\/1.9781611973082.49"},{"key":"8_CR10","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/B978-0-12-358350-5.50006-3","volume-title":"Mathematical Programming","author":"D. Fulkerson","year":"1973","unstructured":"Fulkerson, D.: On the perfect graph theorem. In: Hu, T., Robinson, S. (eds.) Mathematical Programming, pp. 69\u201376. Academic Press, New York (1973)"},{"issue":"4","key":"8_CR11","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579262","volume":"6","author":"A. Gerards","year":"1986","unstructured":"Gerards, A., Schrijver, A.: Matrices with the Edmonds-Johnson property. Combinatorica\u00a06(4), 365\u2013379 (1986)","journal-title":"Combinatorica"},{"key":"8_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Berlin (1988)"},{"key":"8_CR13","unstructured":"Harvey, W., Stuckey, P.: A unit two variable per inequality integer constraint solver for constraint logic programming. In: The 20th Australasian Computer Science Conference, Sydney, Australia. Australian Computer Science Communications, pp. 102\u2013111 (1997)"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0012-365X(81)90218-1","volume":"37","author":"W. Hsu","year":"1981","unstructured":"Hsu, W., Nemhauser, G.: Algorithms for minimum covering by cliques and maximum clique in claw-free perfect graphs. Discrete Math.\u00a037, 181\u2013191 (1981)","journal-title":"Discrete Math."},{"issue":"1","key":"8_CR15","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0012-365X(82)90169-8","volume":"38","author":"W. Hsu","year":"1982","unstructured":"Hsu, W., Nemhauser, G.: A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs. Discrete Math.\u00a038(1), 65\u201371 (1982)","journal-title":"Discrete Math."},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/3-540-58601-6_92","volume-title":"Principles and Practice of Constraint Programming","author":"J. Jaffar","year":"1994","unstructured":"Jaffar, J., Maher, M.J., Stuckey, P.J., Yap, R.H.C.: Beyond Finite Domains. In: PPCP 1994. LNCS, vol.\u00a0874, pp. 86\u201394. Springer, Heidelberg (1994)"},{"key":"8_CR17","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"B. Korte","year":"2011","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms. Springer, Berlin (2011)"},{"key":"8_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/11559306_9","volume-title":"Frontiers of Combining Systems","author":"S.K. Lahiri","year":"2005","unstructured":"Lahiri, S.K., Musuvathi, M.: An Efficient Decision Procedure for UTVPI Constraints. In: Gramlich, B. (ed.) FroCos 2005. LNCS (LNAI), vol.\u00a03717, pp. 168\u2013183. Springer, Heidelberg (2005)"},{"issue":"1","key":"8_CR19","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1006\/jctb.1998.1872","volume":"75","author":"F. Maffray","year":"1999","unstructured":"Maffray, F., Reed, B.: A description of claw-free perfect graphs. J. Combin. Theory, Ser. B\u00a075(1), 134\u2013156 (1999)","journal-title":"J. Combin. Theory, Ser. B"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/BF01580235","volume":"6","author":"M. Padberg","year":"1974","unstructured":"Padberg, M.: Perfect zero-one matrices. Math. Program.\u00a06, 180\u2013196 (1974)","journal-title":"Math. Program."},{"key":"8_CR21","unstructured":"Peis, B.: Structure Analysis of Some Generalizations of Matchings and Matroids under Algorithmic Aspects. PhD thesis, Universit\u00e4t zu K\u00f6ln (2007)"},{"issue":"1","key":"8_CR22","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/BF02574704","volume":"6","author":"A. Schrijver","year":"1991","unstructured":"Schrijver, A.: Disjoint homotopic paths and trees in a planar graph. Discrete Comput. Geom.\u00a06(1), 527\u2013574 (1991)","journal-title":"Discrete Comput. Geom."},{"key":"8_CR23","series-title":"Algorithms and Combinatorics","volume-title":"Combinatorial Optimization. Polyhedra and Efficiency (3 volumes)","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization. Polyhedra and Efficiency (3 volumes). Algorithms and Combinatorics, vol.\u00a024. Springer, Berlin (2003)"},{"issue":"4","key":"8_CR24","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1287\/ijoc.1090.0369","volume":"22","author":"A. Schutt","year":"2010","unstructured":"Schutt, A., Stuckey, P.: Incremental satisfiability and implication for UTVPI constraints. INFORMS J. Comput.\u00a022(4), 514\u2013527 (2010)","journal-title":"INFORMS J. Comput."},{"key":"8_CR25","first-page":"67","volume":"3","author":"S. Seshia","year":"2007","unstructured":"Seshia, S., Subramani, K., Bryant, R.: On solving Boolean combinations of UTVPI constraints. J. Satisf. Boolean Model. Comput.\u00a03, 67\u201390 (2007)","journal-title":"J. Satisf. Boolean Model. Comput."},{"issue":"2","key":"8_CR26","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput.\u00a01(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Whitesides, S.: A method for solving certain graph recognition and optimization problems, with applications to perfect graphs. In: Berge, C., Chv\u00e1tal, V. (eds.) Topics on Perfect Graphs, North-Holland. North-Holland Mathematics Studies, vol.\u00a088, pp. 281\u2013297 (1984)","DOI":"10.1016\/S0304-0208(08)72941-4"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36694-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T13:47:57Z","timestamp":1557582477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36694-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642366932","9783642366949"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36694-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}