{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:18:40Z","timestamp":1775913520617,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,3,6]],"date-time":"2024-03-06T00:00:00Z","timestamp":1709683200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,3,6]],"date-time":"2024-03-06T00:00:00Z","timestamp":1709683200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100008047","name":"Carnegie Mellon University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100008047","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2024,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We show how to round any half-integral solution to the subtour-elimination relaxation for the TSP, while losing a less-than<jats:inline-formula><jats:alternatives><jats:tex-math>$$-$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mo>-<\/mml:mo><\/mml:math><\/jats:alternatives><\/jats:inline-formula>\u00a01.5 factor. Such a rounding algorithm was recently given by Karlin, Klein, and Oveis Gharan based on sampling from max-entropy distributions. We build on an approach of Haddadan and Newman to show how sampling from the matroid intersection polytope, combined with a novel use of max-entropy sampling, can give better guarantees.<\/jats:p>","DOI":"10.1007\/s10107-024-02065-4","type":"journal-article","created":{"date-parts":[[2024,3,6]],"date-time":"2024-03-06T13:02:21Z","timestamp":1709730141000},"page":"541-576","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Matroid-based TSP rounding for half-integral solutions"],"prefix":"10.1007","volume":"206","author":[{"given":"Anupam","family":"Gupta","sequence":"first","affiliation":[]},{"given":"Euiwoong","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Jason","family":"Li","sequence":"additional","affiliation":[]},{"given":"Marcin","family":"Mucha","sequence":"additional","affiliation":[]},{"given":"Heather","family":"Newman","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0006-9994-1733","authenticated-orcid":false,"given":"Sherry","family":"Sarkar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,6]]},"reference":[{"issue":"4","key":"2065_CR1","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1287\/opre.2017.1603","volume":"65","author":"A Asadpour","year":"2017","unstructured":"Asadpour, A., Goemans, M.X., M\u017adry, A., Oveis Gharan, S., Saberi, A.: An o(log n\/log log n)-approximation algorithm for the asymmetric traveling salesman problem. Oper. Res. 65(4), 1043\u20131061 (2017)","journal-title":"Oper. Res."},{"issue":"2","key":"2065_CR2","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1090\/S0894-0347-08-00618-8","volume":"22","author":"J Borcea","year":"2009","unstructured":"Borcea, J., Br\u00e4nd\u00e9d, P., Liggett, T.M.: Negative dependence and the geometry of polynomials. J. Am. Math. Soc. 22(2), 521\u2013567 (2009)","journal-title":"J. Am. Math. Soc."},{"issue":"1\u20132","key":"2065_CR3","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10107-019-01455-3","volume":"186","author":"S Boyd","year":"2021","unstructured":"Boyd, S., Seb\u0151, A.: The salesman\u2019s improved tours for fundamental classes. Math. Program. 186(1\u20132), 289\u2013307 (2021)","journal-title":"Math. Program."},{"key":"2065_CR4","unstructured":"Christofides, Nicos: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical Report 338, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, (1976)"},{"key":"2065_CR5","doi-asserted-by":"crossref","unstructured":"Chekuri, C, Vondrak, J, Zenklusen, R: Dependent randomized rounding via exchange properties of combinatorial structures. In 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pp 575\u2013584, (2010)","DOI":"10.1109\/FOCS.2010.60"},{"key":"2065_CR6","unstructured":"Fleiner, T, Frank, A: A quick proof for the cactus representation of mincuts. Technical Report Quick-proof No.\u00a02009-03, EGRES, (2009)"},{"key":"2065_CR7","unstructured":"Haddadan, Arash, Newman, Alantha: Towards improving Christofides algorithm for half-integer TSP. In 27th Annual European symposium on algorithms, ESA 2019, September 9-11, 2019, Munich\/Garching, Germany, pp 56:1\u201356:12, (2019)"},{"key":"2065_CR8","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1214\/aoms\/1177728178","volume":"27","author":"Wassily Hoeffding","year":"1956","unstructured":"Hoeffding, Wassily: On the distribution of the number of successes in independent trials. Annals Math. Stat. 27, 713\u2013721 (1956)","journal-title":"Annals Math. Stat."},{"key":"2065_CR9","doi-asserted-by":"crossref","unstructured":"Karlin, A\u00a0R., Klein, N, Shayan, OG: An improved approximation algorithm for TSP in the half integral case. In STOC, pages 28\u201339. ACM, (2020)","DOI":"10.1145\/3357713.3384273"},{"key":"2065_CR10","doi-asserted-by":"crossref","unstructured":"Karlin, A\u00a0R., Klein, N, Shayan, OG: A (slightly) improved approximation algorithm for metric TSP. CoRR, abs\/2007.01409, (2020)","DOI":"10.1145\/3406325.3451009"},{"key":"2065_CR11","doi-asserted-by":"crossref","unstructured":"Karlin, A, Klein, N, Shayan, OG: A (slightly) improved bound on the integrality gap of the subtour LP for TSP. CoRR, abs\/2105.10043, (2021)","DOI":"10.1109\/FOCS54457.2022.00084"},{"key":"2065_CR12","doi-asserted-by":"crossref","unstructured":"Shayan, OG, Saberi, A, Singh, M: A randomized rounding approach to the traveling salesman problem. In FOCS, pp 550\u2013559. IEEE Computer Society, (2011)","DOI":"10.1109\/FOCS.2011.80"},{"key":"2065_CR13","first-page":"76","volume":"17","author":"A Serdyukov","year":"1978","unstructured":"Serdyukov, A.: O nekotorykh ekstremal\u2019nykh obkhodakh v grafakh. Upravlyaemye sistemy 17, 76\u201379 (1978)","journal-title":"Upravlyaemye sistemy"},{"issue":"6","key":"2065_CR14","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0020-0190(90)90028-V","volume":"35","author":"DB Shmoys","year":"1990","unstructured":"Shmoys, D.B., Williamson, D.P.: Analyzing the Held-Karp TSP bound: a monotonicity property with application. Inf. Process. Lett. 35(6), 281\u2013285 (1990)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"2065_CR15","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1287\/moor.2013.0608","volume":"39","author":"F Schalekamp","year":"2014","unstructured":"Schalekamp, F., Williamson, D.P., van Zuylen, A.: 2-matchings, the traveling salesman problem, and the subtour LP: A proof of the boyd-carr conjecture. Math. Oper. Res. 39(2), 403\u2013417 (2014)","journal-title":"Math. Oper. Res."},{"key":"2065_CR16","series-title":"Mathematical Programming Studies","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BFb0120913","volume-title":"Combinatorial Optimization II","author":"LA Wolsey","year":"1980","unstructured":"Wolsey, L.A.: Heuristic analysis, linear programming and branch and bound. In: Combinatorial Optimization II. Mathematical Programming Studies, pp. 121\u2013134. Springer, Cham (1980)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02065-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-024-02065-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02065-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,13]],"date-time":"2024-11-13T22:21:04Z","timestamp":1731536464000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-024-02065-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,6]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["2065"],"URL":"https:\/\/doi.org\/10.1007\/s10107-024-02065-4","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,6]]},"assertion":[{"value":"11 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}