{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:49:34Z","timestamp":1743126574669,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031598340"},{"type":"electronic","value":"9783031598357"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-59835-7_18","type":"book-chapter","created":{"date-parts":[[2024,5,21]],"date-time":"2024-05-21T07:05:03Z","timestamp":1716275103000},"page":"238-251","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Lower Bound for\u00a0the\u00a0Max Entropy Algorithm for\u00a0TSP"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6362-2048","authenticated-orcid":false,"given":"Billy","family":"Jin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-4052-5864","authenticated-orcid":false,"given":"Nathan","family":"Klein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2884-0058","authenticated-orcid":false,"given":"David P.","family":"Williamson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,22]]},"reference":[{"key":"18_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\u0105dry, A., Gharan, S.O., Saberi, A.: An $$O$$(log $$n$$\/log log $$n$$)-approximation algorithm for the asymmetric traveling salesman problem. Oper. Res. 65, 1043\u20131061 (2017)","journal-title":"Oper. Res."},{"key":"18_CR2","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, 289\u2013307 (2021)","journal-title":"Math. Program."},{"key":"18_CR3","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 (1976)"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/BF01588956","volume":"14","author":"G Cornuejols","year":"1978","unstructured":"Cornuejols, G., Nemhauser, G.L.: Tight bounds for Christofides\u2019 traveling salesman heuristic. Math. Program. 14, 116\u2013121 (1978)","journal-title":"Math. Program."},{"issue":"4","key":"18_CR5","first-page":"393","volume":"2","author":"G Dantzig","year":"1954","unstructured":"Dantzig, G., Fulkerson, R., Johnson, S.: Solution of a large-scale traveling-salesman problem. J. Oper. Res. Soc. Am. 2(4), 393\u2013410 (1954)","journal-title":"J. Oper. Res. Soc. Am."},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1007\/s00453-017-0293-5","volume":"78","author":"K Genova","year":"2017","unstructured":"Genova, K., Williamson, D.P.: An experimental evaluation of the best-of-many Christofides\u2019 algorithm for the traveling salesman problem. Algorithmica 78, 1109\u20131130 (2017)","journal-title":"Algorithmica"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M Held","year":"1971","unstructured":"Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees. Oper. Res. 18, 1138\u20131162 (1971)","journal-title":"Oper. Res."},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-031-32726-1_16","volume-title":"Integer Programming and Combinatorial Optimization","author":"B Jin","year":"2023","unstructured":"Jin, B., Klein, N., Williamson, D.P.: A 4\/3-approximation algorithm for half-integral cycle cut instances of the TSP. In: Del Pia, A., Kaibel, V. (eds.) IPCO 2023. LNCS, vol. 13904, pp. 217\u2013230. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-32726-1_16"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Karlin, A.R., Klein, N., Gharan, S.O.: An improved approximation algorithm for TSP in the half integral case. In: Proceedings of the 52nd Annual ACM Symposium on the Theory of Computing, pp. 28\u201339 (2020)","DOI":"10.1145\/3357713.3384273"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Karlin, A.R., Klein, N., Gharan, S.O.: A (slightly) improved approximation algorithm for metric TSP. In: Proceedings of the 53rd Annual ACM Symposium on the Theory of Computing, pp. 32\u201345 (2021)","DOI":"10.1145\/3406325.3451009"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Karlin, A., Klein, N., Gharan, S.O.: A (slightly) improved bound on the integrality gap of the subtour LP for TSP. In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), Los Alamitos, CA, USA, pp. 832\u2013843. IEEE Computer Society (2022)","DOI":"10.1109\/FOCS54457.2022.00084"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Gharan, S.O., Saberi, A., Singh, M.: A randomized rounding approach to the traveling salesman problem. In: Proceedings of the 52nd Annual IEEE Symposium on the Foundations of Computer Science, pp. 550\u2013559 (2011)","DOI":"10.1109\/FOCS.2011.80"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0196-6774(84)90029-4","volume":"5","author":"CH Papadimitriou","year":"1984","unstructured":"Papadimitriou, C.H., Vazirani, U.V.: On two geometric problems related to the travelling salesman problem. J. Algorithms 5, 231\u2013246 (1984)","journal-title":"J. Algorithms"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1137\/0206041","volume":"6","author":"DJ Rosenkrantz","year":"1977","unstructured":"Rosenkrantz, D.J., Stearns, R.E., Lewis, P.M., II.: An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. 6, 563\u2013581 (1977)","journal-title":"SIAM J. Comput."},{"key":"18_CR15","first-page":"76","volume":"17","author":"A Serdyukov","year":"1978","unstructured":"Serdyukov, A.: On some extremal walks in graphs. Upravlyaemye Sistemy 17, 76\u201379 (1978)","journal-title":"Upravlyaemye Sistemy"},{"key":"18_CR16","doi-asserted-by":"publisher","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, 597\u2013629 (2014)","journal-title":"Combinatorica"},{"key":"18_CR17","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, 281\u2013285 (1990)","journal-title":"Inf. Process. Lett."},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BFb0120913","volume":"13","author":"LA Wolsey","year":"1980","unstructured":"Wolsey, L.A.: Heuristic analysis, linear programming and branch and bound. Math. Program. Study 13, 121\u2013134 (1980)","journal-title":"Math. Program. Study"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-59835-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,21]],"date-time":"2024-05-21T07:13:34Z","timestamp":1716275614000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-59835-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031598340","9783031598357"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-59835-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wroc\u0142aw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ipco2024.ii.uni.wroc.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}