{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:33:08Z","timestamp":1725489188308},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441861"},{"type":"electronic","value":"9783540457534"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45753-4_6","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T11:37:09Z","timestamp":1187264229000},"page":"40-50","source":"Crossref","is-referenced-by-count":5,"title":["Two Approximation Algorithms for 3-Cycle Covers"],"prefix":"10.1007","author":[{"given":"Markus","family":"Bl\u00e4ser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bodo","family":"Manthey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,4]]},"reference":[{"key":"6_CR1","unstructured":"R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993."},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P. Alimonti","year":"2000","unstructured":"P. Alimonti and V. Kann. Some APX-completeness results for cubic graphs. Theoret. Comput. Sci., 237(1\u20132):123\u2013134, 2000.","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/3-540-44676-1_31","volume-title":"Computing cycle covers without short cycles","author":"M. Bl\u00e4ser","year":"2001","unstructured":"M. Bl\u00e4ser and B. Siebert. Computing cycle covers without short cycles. In Proc. 9th Ann. European Symp. on Algorithms (ESA), volume 2161 of Lecture Notes in Comput. Sci., pages 368\u2013379. Springer, 2001."},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0012-365X(80)90002-3","volume":"29","author":"G. P. Cornu\u00e9jols","year":"1980","unstructured":"G. P. Cornu\u00e9jols and W. R. Pulleyblank. A matching problem with side conditions. Discrete Math., 29:135\u2013159, 1980.","journal-title":"Discrete Math."},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds. Paths, trees, and flowers. Canad. J. Math., 17:449\u2013467, 1965.","journal-title":"Canad. J. Math."},{"issue":"1","key":"6_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/net.3230120103","volume":"12","author":"A. M. Frieze","year":"1982","unstructured":"A. M. Frieze, G. Galbiati, and F. Maffioli. On the worst-case performance of some algorithms for the traveling salesman problem. Networks, 12(1):23\u201339, 1982.","journal-title":"Networks"},{"key":"6_CR7","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979."},{"key":"6_CR8","unstructured":"R. L. Graham, M. Gr\u00f3tschel, and L. Lov\u00e1sz, editors. Handbook of Combinatorics, volume 1. Elsevier, 1995."},{"key":"6_CR9","unstructured":"D. Hartvigsen. An Extension of Matching Theory. PhD thesis, Carnegie-Mellon University, 1984."},{"key":"6_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/3-540-48777-8_18","volume-title":"The square-free 2-factor problem in bipartite graphs","author":"D. Hartvigsen","year":"1999","unstructured":"D. Hartvigsen. The square-free 2-factor problem in bipartite graphs. In Proc. 7th Int. Conf. on Integer Programming and Combinatorial Optimization (IPCO), volume 1620 of Lecture Notes in Comput. Sci., pages 234\u2013241. Springer, 1999."},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"M. Lewenstein and M. Sviridenko. A 5\/8 approximation algorithm for the asymmetric maximum TSP. Manuscript, 2002.","DOI":"10.1137\/S0895480102402861"},{"key":"6_CR12","unstructured":"L. Lov\u00e1sz and M. D. Plummer. Matching Theory. Elsevier, 1986."},{"issue":"3","key":"6_CR13","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C. H. Papadimitriou","year":"1991","unstructured":"C. H. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. J. Comput. System Sci., 43(3):425\u2013440, 1991.","journal-title":"J. Comput. System Sci."},{"key":"6_CR14","first-page":"80","volume":"25","author":"A. I. Serdyukov","year":"1984","unstructured":"A. I. Serdyukov. An algorithm with an estimate for the traveling salesman problem of the maximum. Upravlyaemye Sistemy, 25:80\u201386, 1984. (in Russian).","journal-title":"Upravlyaemye Sistemy"},{"key":"6_CR15","doi-asserted-by":"crossref","first-page":"347","DOI":"10.4153\/CJM-1954-033-3","volume":"6","author":"W. T. Tutte","year":"1954","unstructured":"W. T. Tutte. A short proof of the factor theorem for finite graphs. Canad. J. Math., 6:347\u2013352, 1954.","journal-title":"Canad. J. Math."},{"issue":"2","key":"6_CR16","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L. G. Valiant","year":"1979","unstructured":"L. G. Valiant. The complexity of computing the permanent. Theoret. Comput. Sci., 8(2):189\u2013201, 1979.","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Approximation Algorithms for Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45753-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T04:33:11Z","timestamp":1556771591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45753-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441861","9783540457534"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45753-4_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}