{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:38:46Z","timestamp":1725471526897},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540483816"},{"type":"electronic","value":"9783540483823"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11917496_30","type":"book-chapter","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T02:16:13Z","timestamp":1161137773000},"page":"336-347","source":"Crossref","is-referenced-by-count":1,"title":["Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions"],"prefix":"10.1007","author":[{"given":"Bodo","family":"Manthey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_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)"},{"key":"30_CR2","doi-asserted-by":"crossref","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":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-27821-4_6","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"M. Bl\u00e4ser","year":"2004","unstructured":"Bl\u00e4ser, M.: A 3\/4-approximation algorithm for maximum ATSP with weights zero and one. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol.\u00a03122, pp. 61\u201371. Springer, Heidelberg (2004)"},{"issue":"2","key":"30_CR4","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":"30_CR5","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":"30_CR6","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":"30_CR7","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":"4","key":"30_CR8","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1145\/179812.179818","volume":"41","author":"A.L. Blum","year":"1994","unstructured":"Blum, A.L., Jiang, T., Li, M., Tromp, J., Yannakakis, M.: Linear approximation of shortest superstrings. J. ACM\u00a041(4), 630\u2013647 (1994)","journal-title":"J. ACM"},{"issue":"3","key":"30_CR9","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0020-0190(00)00089-2","volume":"75","author":"H.-J. B\u00f6ckenhauer","year":"2000","unstructured":"B\u00f6ckenhauer, H.-J., Hromkovi\u010d, J., Klasing, R., Seibert, S., Unger, W.: Approximation algorithms for the TSP with sharpened triangle inequality. Inform. Process. Lett.\u00a075(3), 133\u2013138 (2000)","journal-title":"Inform. Process. Lett."},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/3-540-45841-7_18","volume-title":"STACS 2002","author":"L. Sunil Chandran","year":"2002","unstructured":"Sunil Chandran, L., Shankar Ram, L.: Approximations for ATSP with parametrized triangle inequality. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 227\u2013237. Springer, Heidelberg (2002)"},{"key":"30_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/11561071_18","volume-title":"Algorithms \u2013 ESA 2005","author":"Z.-Z. Chen","year":"2005","unstructured":"Chen, Z.-Z., Nagoya, T.: Improved approximation algorithms for metric Max TSP. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 179\u2013190. Springer, Heidelberg (2005)"},{"issue":"2","key":"30_CR12","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.ipl.2005.03.011","volume":"95","author":"Z.-Z. Chen","year":"2005","unstructured":"Chen, Z.-Z., Okamoto, Y., Wang, L.: Improved deterministic approximation algorithms for Max TSP. Inform. Process. Lett.\u00a095(2), 333\u2013342 (2005)","journal-title":"Inform. Process. Lett."},{"key":"30_CR13","unstructured":"Hartvigsen, D.: An Extension of Matching Theory. PhD thesis, Carnegie Mellon University, Pittsburgh, USA (1984)"},{"issue":"1","key":"30_CR14","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":"6","key":"30_CR15","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1016\/j.dam.2005.11.003","volume":"154","author":"R. Hassin","year":"2006","unstructured":"Hassin, R., Rubinstein, S.: An approximation algorithm for maximum triangle packing. Discrete Appl. Math.\u00a0154(6), 971\u2013979 (2006)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"30_CR16","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."},{"issue":"4","key":"30_CR17","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1145\/1082036.1082041","volume":"52","author":"H. Kaplan","year":"2005","unstructured":"Kaplan, H., Lewenstein, M., Shafrir, N., Sviridenko, M.: Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. J. ACM\u00a052(4), 602\u2013626 (2005)","journal-title":"J. ACM"},{"key":"30_CR18","volume-title":"North-Holland Mathematics Studies","author":"L. Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory. In: North-Holland Mathematics Studies, vol.\u00a0121. Elsevier, Amsterdam (1986)"},{"key":"30_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/11671411_22","volume-title":"Approximation and Online Algorithms","author":"B. Manthey","year":"2006","unstructured":"Manthey, B.: On approximating restricted cycle covers. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol.\u00a03879, pp. 282\u2013295. Springer, Heidelberg (2006)"},{"key":"30_CR20","volume-title":"Algorithms and Combinatorics","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. In: Algorithms and Combinatorics, vol.\u00a024. Springer, Heidelberg (2003)"},{"issue":"3","key":"30_CR21","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1137\/S0097539796324661","volume":"29","author":"Z. Sweedyk","year":"1999","unstructured":"Sweedyk, Z.: A \n                  \n                    \n                  \n                  $2\\frac12$\n                -approximation algorithm for shortest superstring. SIAM J. Comput.\u00a029(3), 954\u2013986 (1999)","journal-title":"SIAM J. Comput."},{"key":"30_CR22","unstructured":"Vornberger, O.: Easy and hard cycle covers. Technical report, Universit\u00e4t\/Gesamthochschule Paderborn (1980)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11917496_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:42:33Z","timestamp":1619494953000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11917496_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540483816","9783540483823"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11917496_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}