{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:14:32Z","timestamp":1763468072476,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,5,19]]},"DOI":"10.1145\/2213977.2214055","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"875-886","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Improving christofides' algorithm for the s-t path TSP"],"prefix":"10.1145","author":[{"given":"Hyung-Chan","family":"An","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}]},{"given":"Robert","family":"Kleinberg","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}]},{"given":"David B.","family":"Shmoys","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"H.-C. An R. Kleinberg and D. B. Shmoys. Improving Christofides' Algorithm for the s-t Path TSP. CoRR abs\/1110.4604 2011.  H.-C. An R. Kleinberg and D. B. Shmoys. Improving Christofides' Algorithm for the s-t Path TSP. CoRR abs\/1110.4604 2011."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1886521.1886523"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(98)00046-7"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/090771429"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873633"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-010-0252-4"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"E. Balas. The prize collecting traveling salesman problem. Networks} 19(6):621--636 1989.  E. Balas. The prize collecting traveling salesman problem. Networks} 19(6):621--636 1989.","DOI":"10.1002\/net.3230190602"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(97)00032-1"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581256"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946316"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584082"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580113"},{"key":"e_1_3_2_2_14_1","unstructured":"M. X. Goemans. Unpublished manuscript 1990.  M. X. Goemans. Unpublished manuscript 1990."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585563"},{"key":"e_1_3_2_2_16_1","unstructured":"M. X. Goemans. Combining approximation algorithms for the prize-collecting TSP. CoRR abs\/0910.0553 2009.  M. X. Goemans. Combining approximation algorithms for the prize-collecting TSP. CoRR abs\/0910.0553 2009."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580607"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793242618"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579273"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010045"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.18.6.1138"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(91)90016-I"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.56"},{"key":"e_1_3_2_2_24_1","unstructured":"M. Mucha. 13\/9-approximation for graphic TSP. CoRR abs\/1108.1130 2011.  M. Mucha. 13\/9-approximation for graphic TSP. CoRR abs\/1108.1130 2011."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.80"},{"key":"e_1_3_2_2_26_1","unstructured":"A. Sebo and J. Vygen. Shorter tours by nicer ears: 7\/5-approximation for graphic TSP 3\/2 for the path version and 4\/3 for two-edge-connected subgraphs. CoRR abs\/1201.1870 2012.  A. Sebo and J. Vygen. Shorter tours by nicer ears: 7\/5-approximation for graphic TSP 3\/2 for the path version and 4\/3 for two-edge-connected subgraphs. CoRR abs\/1201.1870 2012."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(90)90028-V"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120913"}],"event":{"name":"STOC'12: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"New York New York USA","acronym":"STOC'12"},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214055","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214055","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:54Z","timestamp":1750238454000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214055"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":27,"alternative-id":["10.1145\/2213977.2214055","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214055","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}