{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:43:04Z","timestamp":1787323384672,"version":"build-2736575974"},"reference-count":15,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","funder":[{"DOI":"10.13039\/501100005357","name":"Agent\u00fara na Podporu V\u00fdskumu a V\u00fdvoja","doi-asserted-by":"publisher","award":["APVV-15-0220"],"award-info":[{"award-number":["APVV-15-0220"]}],"id":[{"id":"10.13039\/501100005357","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006109","name":"Vedeck\u00e1 Grantov\u00e1 Agent\u00fara MVVa SR a SAV","doi-asserted-by":"publisher","award":["1\/0813\/18"],"award-info":[{"award-number":["1\/0813\/18"]}],"id":[{"id":"10.13039\/501100006109","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006109","name":"Vedeck\u00e1 Grantov\u00e1 Agent\u00fara MVVa SR a SAV","doi-asserted-by":"publisher","award":["1\/0876\/16"],"award-info":[{"award-number":["1\/0876\/16"]}],"id":[{"id":"10.13039\/501100006109","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>We prove that every simple bridgeless cubic graph with $n \\ge 8$ vertices has a traveling salesman tour of length at most $1.3\\cdot n - 2$, which can be constructed in polynomial time.<\/jats:p>","DOI":"10.1137\/15m1032247","type":"journal-article","created":{"date-parts":[[2018,8,14]],"date-time":"2018-08-14T10:57:06Z","timestamp":1534244226000},"page":"2094-2114","source":"Crossref","is-referenced-by-count":1,"title":["Cubic TSP: A 1.3-Approximation"],"prefix":"10.1137","volume":"32","author":[{"given":"Barbora","family":"Dun\u00edk","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Luko\u0165ka","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2018,8,14]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290180"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480102409619"},{"key":"atypb3","first-page":"641","author":"Berman P.","year":"2006","journal-title":"Philadelphia"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0620-1"},{"key":"atypb5","unstructured":"N. Christofides,\n                      Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem\n                      , Tech. Report 388, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA, 1976."},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1137\/140972925"},{"key":"atypb7","unstructured":"R. Diestel,\n                      Graph Theory\n                      , 5th ed., Springer-Verlag, New York, 2016."},{"key":"atypb8","unstructured":"Z. Dvorak, D. Kral, and B. Mohar,\n                      Graphic TSP in Cubic Graphs\n                      , preprint,https:\/\/arxiv.org\/abs\/1608.07568, 2016."},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.6028\/jres.069B.013"},{"key":"atypb10","unstructured":"J. Karp and R. Ravi,\n                      A 9\/7-Approximation Algorithm for Graphic TSP in Cubic Bipartite Graphs\n                      , preprint,https:\/\/arxiv.org\/abs\/1311.3640, 2013."},{"key":"atypb11","first-page":"243","author":"Lampis M.","year":"2012","journal-title":"Heidelberg"},{"key":"atypb12","first-page":"4","volume":"21","author":"Lukot\u030cka R.","year":"2014","journal-title":"Avoiding 7-circuits in 2-factors of cubic graphs, Electron. J. Combin."},{"key":"atypb13","first-page":"560","author":"Mo\u0308mke T.","year":"2011","journal-title":"Washington, DC"},{"key":"atypb14","first-page":"250","author":"A","year":"2016","journal-title":"Cham"},{"key":"atypb15","first-page":"1","volume":"90","author":"Vygen J.","year":"2012","journal-title":"Optima"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/15M1032247","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:59:16Z","timestamp":1787320756000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/15M1032247"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1137\/15M1032247"],"URL":"https:\/\/doi.org\/10.1137\/15m1032247","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}