{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:40:44Z","timestamp":1775054444109,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540322078","type":"print"},{"value":"9783540322085","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11671411_22","type":"book-chapter","created":{"date-parts":[[2006,2,15]],"date-time":"2006-02-15T09:26:35Z","timestamp":1139995595000},"page":"282-295","source":"Crossref","is-referenced-by-count":3,"title":["On Approximating Restricted Cycle Covers"],"prefix":"10.1007","author":[{"given":"Bodo","family":"Manthey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"issue":"1\u20132","key":"22_CR2","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P. Alimonti","year":"2000","unstructured":"Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theoret. Comput. Sci.\u00a0237(1\u20132), 123\u2013134 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (1999)"},{"key":"22_CR4","unstructured":"Bl\u00e4ser, M.: Approximationsalgorithmen f\u00fcr Graph\u00fcberdeckungsprobleme. Habilitationsschrift, Institut f\u00fcr Theoretische Informatik, Universit\u00e4t zu L\u00fcbeck, L\u00fcbeck, Germany (2002)"},{"issue":"2","key":"22_CR5","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s00453-004-1131-0","volume":"42","author":"M. Bl\u00e4ser","year":"2005","unstructured":"Bl\u00e4ser, M., Manthey, B.: Approximating maximum weight cycle covers in directed graphs with weights zero and one. Algorithmica\u00a042(2), 121\u2013139 (2005)","journal-title":"Algorithmica"},{"key":"22_CR6","unstructured":"Bl\u00e4ser, M., Manthey, B., Sgall, J.: An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality. J. Discrete Algorithms (to appear)"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/11534273_31","volume-title":"Algorithms and Data Structures","author":"M. Bl\u00e4ser","year":"2005","unstructured":"Bl\u00e4ser, M., Shankar Ram, L., Sviridenko, M.I.: Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems. In: Dehne, F., L\u00f3pez-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol.\u00a03608, pp. 350\u2013359. Springer, Heidelberg (2005)"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/3-540-44676-1_31","volume-title":"Algorithms - ESA 2001","author":"M. Bl\u00e4ser","year":"2001","unstructured":"Bl\u00e4ser, M., Siebert, B.: Computing cycle covers without short cycles. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 368\u2013379. Springer, Heidelberg (2001)"},{"issue":"2","key":"22_CR9","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":"Cornu\u00e9jols, G.P., Pulleyblank, W.R.: A matching problem with side conditions. Discrete Math.\u00a029(2), 135\u2013159 (1980)","journal-title":"Discrete Math."},{"key":"22_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"key":"22_CR11","unstructured":"Hartvigsen, D.: An Extension of Matching Theory. PhD thesis, Department of Mathematics, Carnegie Mellon University (1984)"},{"issue":"1","key":"22_CR12","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.orl.2004.04.003","volume":"33","author":"R. Hassin","year":"2005","unstructured":"Hassin, R., Rubinstein, S.: On the complexity of the k-customer vehicle routing problem. Oper. Res. Lett.\u00a033(1), 71\u201376 (2005)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"22_CR13","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1137\/0401046","volume":"1","author":"P. Hell","year":"1988","unstructured":"Hell, P., Kirkpatrick, D.G., Kratochv\u00edl, J., Kr\u00edz, I.: On restricted two-factors. SIAM J. Discrete Math.\u00a01(4), 472\u2013484 (1988)","journal-title":"SIAM J. Discrete Math."},{"key":"22_CR14","unstructured":"Vornberger, O.: Easy and hard cycle covers. Technical report, Universit\u00e4t\/ Gesamthochschule Paderborn (1980)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11671411_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:14:24Z","timestamp":1619507664000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11671411_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540322078","9783540322085"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11671411_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}