{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T04:42:23Z","timestamp":1725856943969},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319334608"},{"type":"electronic","value":"9783319334615"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-33461-5_21","type":"book-chapter","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T18:35:59Z","timestamp":1464114959000},"page":"250-261","source":"Crossref","is-referenced-by-count":2,"title":["Improved Approximations for Cubic Bipartite and Cubic TSP"],"prefix":"10.1007","author":[{"given":"Anke","family":"van Zuylen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,25]]},"reference":[{"key":"21_CR1","unstructured":"Aggarwal, N., Garg, N., Gupta, S.: A 4\/3-approximation for TSP on cubic 3-edge-connected graphs (2011). http:\/\/arxiv.org\/abs\/1101.5586"},{"key":"21_CR2","unstructured":"Barnette, D.W.: Conjecture 5. In: Recent Progress in Combinatorics (1969)"},{"issue":"1\u20132","key":"21_CR3","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s10107-012-0620-1","volume":"144","author":"S Boyd","year":"2014","unstructured":"Boyd, S., Sitters, R., van der Ster, S., Stougie, L.: The traveling salesman problem on cubic and subcubic graphs. Math. Program. 144(1\u20132), 227\u2013245 (2014)","journal-title":"Math. Program."},{"key":"21_CR4","unstructured":"Candr\u00e1kov\u00e1, B., Lukotka, R.: Cubic TSP - a 1.3-approximation. CoRR abs\/1506.06369 (2015)"},{"key":"21_CR5","unstructured":"Christofides, N.: Worst case analysis of a new heuristic for the traveling salesman problem. Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA (1976)"},{"issue":"2","key":"21_CR6","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1137\/140972925","volume":"29","author":"JR Correa","year":"2015","unstructured":"Correa, J.R., Larr\u00e9, O., Soto, J.A.: TSP tours in cubic graphs: beyond 4\/3. SIAM J. Discrete Math. 29(2), 915\u2013939 (2015)","journal-title":"SIAM J. Discrete Math."},{"key":"21_CR7","first-page":"393","volume":"2","author":"GB Dantzig","year":"1954","unstructured":"Dantzig, G.B., Fulkerson, D.R., Johnson, S.M.: Solution of a large-scale traveling-salesman problem. Oper. Res. 2, 393\u2013410 (1954)","journal-title":"Oper. Res."},{"issue":"5","key":"21_CR8","doi-asserted-by":"crossref","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. 33(5), 467\u2013474 (2005)","journal-title":"Oper. Res. Lett."},{"key":"21_CR9","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M Held","year":"1970","unstructured":"Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees. Oper. Res. 18, 1138\u20131162 (1970)","journal-title":"Oper. Res."},{"key":"21_CR10","unstructured":"Karp, J., Ravi, R.: A 9\/7-approximation algorithm for graphic TSP in cubic bipartite graphs. In: Approximation, Randomization, and Combinatorial Optimization (APPROX-RANDOM). LIPIcs, vol. 28, pp. 284\u2013296. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2014)"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"M\u00f6mke, T., Svensson, O.: Approximating graphic TSP by matchings. In: Proceedings of the 52th Annual Symposium on Foundations of Computer Science, pp. 560\u2013569 (2011)","DOI":"10.1109\/FOCS.2011.56"},{"issue":"4","key":"21_CR12","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1007\/s00224-012-9439-7","volume":"55","author":"M Mucha","year":"2014","unstructured":"Mucha, M.: 13\/9-approximation for graphic TSP. Theory Comput. Syst. 55(4), 640\u2013657 (2014)","journal-title":"Theory Comput. Syst."},{"issue":"5","key":"21_CR13","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/s00493-014-2960-3","volume":"34","author":"A Seb\u0151","year":"2014","unstructured":"Seb\u0151, A., Vygen, J.: Shorter tours by nicer ears: 7\/5-approximation for the graph-TSP, 3\/2 for the path version, and 4\/3 for two-edge-connected subgraphs. Combinatorica 34(5), 597\u2013629 (2014)","journal-title":"Combinatorica"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"van Zuylen, A.: Improved approximations for cubic and cubic bipartite TSP. CoRR abs\/1507.07121 (2015)","DOI":"10.1007\/978-3-319-33461-5_21"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-33461-5_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T15:46:51Z","timestamp":1567957611000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-33461-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319334608","9783319334615"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-33461-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}