{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:34:17Z","timestamp":1725701657144},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330896"},{"type":"electronic","value":"9783642330902"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_68","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T15:29:11Z","timestamp":1346167751000},"page":"790-801","source":"Crossref","is-referenced-by-count":2,"title":["TSP Tours in Cubic Graphs: Beyond 4\/3"],"prefix":"10.1007","author":[{"given":"Jos\u00e9 R.","family":"Correa","sequence":"first","affiliation":[]},{"given":"Omar","family":"Larr\u00e9","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 A.","family":"Soto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"68_CR1","unstructured":"Aggarwal, N., Garg, N., Gupta, S.: A 4\/3-approximation for TSP on cubic 3-edge-connected graphs. arXiv:1101.5586v1 (2011)"},{"key":"68_CR2","doi-asserted-by":"crossref","unstructured":"An, H.-C., Kleinberg, R., Shmoys, D.B.: Improving Christofides\u2019 Algorithm for the s-t Path TSP. In: STOC 2012 (2012)","DOI":"10.1145\/2213977.2214055"},{"key":"68_CR3","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1137\/S0895480102409619","volume":"17","author":"F. Barahona","year":"2004","unstructured":"Barahona, F.: Fractional packing of T-joins. SIAM J. Disc. Math.\u00a017, 661\u2013669 (2004)","journal-title":"SIAM J. Disc. Math."},{"key":"68_CR4","unstructured":"Barnette, D.: Conjecture 5. In: Tutte, W.T. (ed.) Recent Progress in Combinatorics: Proceedings of the Third Waterloo Conference on Combinatorics (1968)"},{"key":"68_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-642-20807-2_6","volume-title":"Integer Programming and Combinatoral Optimization","author":"S. Boyd","year":"2011","unstructured":"Boyd, S., Sitters, R., van der Ster, S., Stougie, L.: TSP on Cubic and Subcubic Graphs. In: G\u00fcnl\u00fck, O., Woeginger, G.J. (eds.) IPCO 2011. LNCS, vol.\u00a06655, pp. 65\u201377. Springer, Heidelberg (2011)"},{"key":"68_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory With Applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory With Applications. Macmillan, London (1976)"},{"key":"68_CR7","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem, Report 388, Graduate School of Industrial Administration, CMU (1976)"},{"issue":"5","key":"68_CR8","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1016\/j.orl.2004.09.005","volume":"33","author":"D. Gamarnik","year":"2005","unstructured":"Gamarnik, D., Lewenstein, M., Sviridenko, M.: An improved upper bound for the TSP in cubic 3-edge-connected graphs. Oper. Res. Lett.\u00a033(5), 467\u2013474 (2005)","journal-title":"Oper. Res. Lett."},{"key":"68_CR9","first-page":"335","volume":"69","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X.: Worst-case comparison of valid inequalities for the TSP. Math. Program.\u00a069, 335\u2013349 (1995)","journal-title":"Math. Program."},{"key":"68_CR10","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K., Ozeki, K.: Spanning closed walks and TSP in 3-connected planar graphs. In: SODA 2012 (2012)","DOI":"10.1137\/1.9781611973099.56"},{"key":"68_CR11","doi-asserted-by":"crossref","unstructured":"M\u00f6mke, T., Svensson, O.: Approximating graphic TSP by matchings. In: FOCS 2011 (2011)","DOI":"10.1109\/FOCS.2011.56"},{"key":"68_CR12","doi-asserted-by":"crossref","unstructured":"Mucha, M.: 13\/9-approximation for graphic TSP. In: STACS 2012 (2012)","DOI":"10.1007\/s00224-012-9439-7"},{"key":"68_CR13","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0012-365X(81)90006-6","volume":"34","author":"D. Naddef","year":"1981","unstructured":"Naddef, D., Pulleyblank, W.: Matchings in regular graphs. Discrete Math.\u00a034, 283\u2013291 (1981)","journal-title":"Discrete Math."},{"key":"68_CR14","unstructured":"Oveis Gharan, S., Saberi, A., Singh, M.: Worst case analysis of a new heuristic for the traveling salesman problem. In: FOCS 2011 (2011)"},{"issue":"1","key":"68_CR15","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s00493-006-0008-z","volume":"26","author":"C.H. Papadimitriou","year":"2006","unstructured":"Papadimitriou, C.H., Vempala, S.: On the approximability of the Traveling Salesman Problem. Combinatorica\u00a026(1), 101\u2013120 (2006)","journal-title":"Combinatorica"},{"key":"68_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/978-3-642-29344-3_51","volume-title":"LATIN 2012: Theoretical Informatics","author":"J. Qian","year":"2012","unstructured":"Qian, J., Schalekamp, F., Williamson, D.P., van Zuylen, A.: On the Integrality Gap of the Subtour LP for the 1,2-TSP. In: Fern\u00e1ndez-Baca, D. (ed.) LATIN 2012. LNCS, vol.\u00a07256, pp. 606\u2013617. Springer, Heidelberg (2012)"},{"key":"68_CR17","doi-asserted-by":"crossref","unstructured":"Schalekamp, F., Williamson, D.P., van Zuylen, A.: A proof of the Boyd-Carr conjecture. In: SODA 2012 (2012)","DOI":"10.1137\/1.9781611973099.117"},{"key":"68_CR18","first-page":"30","volume":"17","author":"P.G. Tait","year":"1884","unstructured":"Tait, P.G.: Listing\u2019s Topologie. Philosophical Magazine\u00a017, 30\u201346 (1884)","journal-title":"Philosophical Magazine"},{"key":"68_CR19","first-page":"169","volume":"7","author":"W.T. Tutte","year":"1946","unstructured":"Tutte, W.T.: On hamiltonian circuits. J. London Math. Soc.\u00a07, 169\u2013176 (1946)","journal-title":"J. London Math. Soc."},{"key":"68_CR20","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BFb0120913","volume":"13","author":"L.A. Wolsey","year":"1980","unstructured":"Wolsey, L.A.: Heuristic analysis, linear programming and branch and bound. Mathematical Programming Studies\u00a013, 121\u2013134 (1980)","journal-title":"Mathematical Programming Studies"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_68.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:55:07Z","timestamp":1620129307000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}