{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T17:11:09Z","timestamp":1676826669833},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,8,14]],"date-time":"2010-08-14T00:00:00Z","timestamp":1281744000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s10878-010-9347-1","type":"journal-article","created":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T18:28:48Z","timestamp":1281724128000},"page":"167-188","source":"Crossref","is-referenced-by-count":1,"title":["Packing cycles exactly in polynomial time"],"prefix":"10.1007","volume":"23","author":[{"given":"Qin","family":"Chen","sequence":"first","affiliation":[]},{"given":"Xujin","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,8,14]]},"reference":[{"key":"9347_CR1","doi-asserted-by":"crossref","first-page":"1993","DOI":"10.1137\/S0097539798338163","volume":"30","author":"MC Cai","year":"2001","unstructured":"Cai MC, Deng XT, Zang W (2001) An approximation algorithm for feedback vertex sets in tournaments. SIAM J Comput 30:1993\u20132007","journal-title":"SIAM J Comput"},{"key":"9347_CR2","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0167-6377(98)00021-2","volume":"22","author":"FA Chudak","year":"1998","unstructured":"Chudak FA, Goemans MX, Hochbaum DS, Williamson DP (1998) A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs. Oper Res Lett 22:111\u2013118","journal-title":"Oper Res Lett"},{"key":"9347_CR3","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717105","volume-title":"Combinatorial optimization: Packing and covering","author":"G Cornu\u00e9jols","year":"2001","unstructured":"Cornu\u00e9jols G (2001) Combinatorial optimization: Packing and covering. Society for Industrial and Applied Mathematics, Philadelphia"},{"key":"9347_CR4","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1:269\u2013271","journal-title":"Numer Math"},{"key":"9347_CR5","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1006\/jctb.2002.2134","volume":"86","author":"G Ding","year":"2002","unstructured":"Ding G, Zang W (2002) Packing cycles in graphs. J Comb Theory Ser B 86:381\u2013407","journal-title":"J Comb Theory Ser B"},{"key":"9347_CR6","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/S0095-8956(02)00007-2","volume":"87","author":"G Ding","year":"2003","unstructured":"Ding G, Xu Z, Zang W (2003) Packing cycles in graphs, II. J Comb Theory Ser B 87:244\u2013253","journal-title":"J Comb Theory Ser B"},{"key":"9347_CR7","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0167-5060(08)70734-9","volume":"1","author":"J Edmonds","year":"1977","unstructured":"Edmonds J, Giles R (1977) A min-max relation for submodular functions on graphs. Ann Discrete Math 1:185\u2013204","journal-title":"Ann Discrete Math"},{"key":"9347_CR8","doi-asserted-by":"crossref","first-page":"347","DOI":"10.4153\/CJM-1965-035-8","volume":"17","author":"P Erd\u00f6s","year":"1965","unstructured":"Erd\u00f6s P, P\u00f3sa L (1965) On independent circuits contained in a graph. Can J Math 17:347\u2013352","journal-title":"Can J Math"},{"key":"9347_CR9","first-page":"63","volume":"41","author":"A Frank","year":"1979","unstructured":"Frank A (1979) Kernel systems of directed graphs. Acta Sci Math [Szeged] 41:63\u201376","journal-title":"Acta Sci Math [Szeged]"},{"key":"9347_CR10","volume-title":"Computers and intractability","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability. WH Freeman, New York"},{"key":"9347_CR11","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M Gr\u00f6schel","year":"1981","unstructured":"Gr\u00f6schel M, Lov\u00e1sz L, Schrijver A (1981) The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1:169\u2013197","journal-title":"Combinatorica"},{"key":"9347_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric algorithms and cominatorial optimization","author":"M Gr\u00f6schel","year":"1988","unstructured":"Gr\u00f6schel M, Lov\u00e1sz L, Schrijver A (1988) Geometric algorithms and cominatorial optimization. Springer, Berlin"},{"key":"9347_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-21711-5","volume-title":"Combinatorial optimization: Theory and algorithms","author":"B Korte","year":"2002","unstructured":"Korte B, Vygen J (2002) Combinatorial optimization: Theory and algorithms. Springer, Berlin"},{"key":"9347_CR14","doi-asserted-by":"crossref","unstructured":"Krivelevich M, Nutov Z, Salavatipour MR, Yuster J, Yuster R (2007) Approximation algorithms and hardness results for cycle packing problems ACM Trans Algorithms 3, Article No 48","DOI":"10.1145\/1290672.1290685"},{"key":"9347_CR15","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/BF01902352","volume":"26","author":"L Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz L (1975) 2-matchings and 2-covers of hypergraphs. Acta Math Acad Sci Hung 26:433\u2013444","journal-title":"Acta Math Acad Sci Hung"},{"key":"9347_CR16","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/0020-0190(73)90029-X","volume":"2","author":"ND Roussopoulos","year":"1973","unstructured":"Roussopoulos ND (1973) A max {m,n} algorithm for determining the graph H from its line graph G. Inf Process Lett 2:108\u2013112","journal-title":"Inf Process Lett"},{"key":"9347_CR17","doi-asserted-by":"crossref","unstructured":"Salavatipour MR, Verstra\u00ebte J (2005) Disjoint cycles: integrality gap, hardness and approximation. In: Lecture notes in computer science, vol\u00a03509, pp\u00a051\u201365","DOI":"10.1007\/11496915_5"},{"key":"9347_CR18","volume-title":"Theory of linear and integer programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver A (1986) Theory of linear and integer programming. Wiley, New York"},{"key":"9347_CR19","volume-title":"Combinatorial optimization\u2014polyhedra and efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver A (2003) Combinatorial optimization\u2014polyhedra and efficiency. Springer, Berlin"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9347-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9347-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9347-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T20:43:55Z","timestamp":1559421835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9347-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,14]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["9347"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9347-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,14]]}}}