{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:46:12Z","timestamp":1725497172034},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540748380"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74839-7_18","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T14:55:58Z","timestamp":1196952958000},"page":"178-189","source":"Crossref","is-referenced-by-count":2,"title":["Minimum-Weight Cycle\u00a0Covers and Their\u00a0Approximability"],"prefix":"10.1007","author":[{"given":"Bodo","family":"Manthey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_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":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"18_CR3","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"},{"issue":"4","key":"18_CR4","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/j.jda.2005.07.004","volume":"4","author":"M. Bl\u00e4ser","year":"2006","unstructured":"Bl\u00e4ser, M., Manthey, B., Sgall, J.: An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality. Journal of Discrete Algorithms\u00a04(4), 623\u2013632 (2006)","journal-title":"Journal of Discrete Algorithms"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"18_CR6","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":"18_CR7","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. Journal of the ACM\u00a041(4), 630\u2013647 (1994)","journal-title":"Journal of the ACM"},{"issue":"3","key":"18_CR8","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. Information Processing Letters\u00a075(3), 133\u2013138 (2000)","journal-title":"Information Processing Letters"},{"issue":"1-3","key":"18_CR9","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.tcs.2006.10.026","volume":"370","author":"L. Sunil Chandran","year":"2007","unstructured":"Sunil Chandran, L., Shankar Ram, L.: On the relationship between ATSP and the cycle cover problem. Theoretical Computer Science\u00a0370(1-3), 218\u2013228 (2007)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"18_CR10","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. Information Processing Letters\u00a095(2), 333\u2013342 (2005)","journal-title":"Information Processing Letters"},{"issue":"2","key":"18_CR11","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM Journal on Computing\u00a024(2), 296\u2013317 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR12","unstructured":"Hartvigsen, D.: An Extension of Matching Theory. PhD thesis, Department of Mathematics, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA (September 1984)"},{"issue":"1","key":"18_CR13","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. Operations Research Letters\u00a033(1), 71\u201376 (2005)","journal-title":"Operations Research Letters"},{"issue":"18","key":"18_CR14","doi-asserted-by":"publisher","first-page":"2620","DOI":"10.1016\/j.dam.2006.05.005","volume":"154","author":"R. Hassin","year":"2006","unstructured":"Hassin, R., Rubinstein, S.: Erratum to \u201cAn approximation algorithm for maximum triangle packing\u201d [Discrete Applied Mathematics 154, 971\u2013979 (2006)]. Discrete Applied Mathematics\u00a0154(18), 2620 (2006)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"18_CR15","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 Journal on Discrete Mathematics\u00a01(4), 472\u2013484 (1988)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"4","key":"18_CR16","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.I.: Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. Journal of the ACM\u00a052(4), 602\u2013626 (2005)","journal-title":"Journal of the ACM"},{"key":"18_CR17","series-title":"North-Holland Mathematics Studies","volume-title":"Matching Theory","author":"L. Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory. North-Holland Mathematics Studies, vol.\u00a0121. Elsevier, Amsterdam (1986)"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/11917496_30","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"B. Manthey","year":"2006","unstructured":"Manthey, B.: Approximation algorithms for restricted cycle covers based on cycle decompositions. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol.\u00a04271, pp. 336\u2013347. Springer, Heidelberg (2006)"},{"key":"18_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":"18_CR20","unstructured":"Manthey, B.: On approximating restricted cycle covers. Report 07-011, Electronic Colloquium on Computational Complexity (ECCC) (2007)"},{"key":"18_CR21","series-title":"Studies in Logic and The Foundations of Mathematics","volume-title":"Classical Recursion Theory","author":"P. Odifreddi","year":"1989","unstructured":"Odifreddi, P.: Classical Recursion Theory. Studies in Logic and The Foundations of Mathematics, vol.\u00a0125. Elsevier, Amsterdam (1989)"},{"key":"18_CR22","series-title":"Oxford Lecture Series in Mathematics and Its Applications","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198568209.001.0001","volume-title":"The Diophantine Frobenius Problem","author":"J.L. Ram\u00edrez Alfons\u00edn","year":"2005","unstructured":"Ram\u00edrez Alfons\u00edn, J.L.: The Diophantine Frobenius Problem. Oxford Lecture Series in Mathematics and Its Applications, vol.\u00a030. Oxford University Press, Oxford (2005)"},{"key":"18_CR23","series-title":"Algorithms and Combinatorics","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and Combinatorics, vol.\u00a024. Springer, Heidelberg (2003)"},{"issue":"3","key":"18_CR24","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 Journal on Computing\u00a029(3), 954\u2013986 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR25","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":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74839-7_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:42:32Z","timestamp":1619520152000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74839-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540748380"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74839-7_18","relation":{},"subject":[]}}