{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:42:30Z","timestamp":1743100950678,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030179526"},{"type":"electronic","value":"9783030179533"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17953-3_22","type":"book-chapter","created":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:17:39Z","timestamp":1556752659000},"page":"288-298","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Asymmetric Traveling Salesman Path LP Has Constant Integrality Ratio"],"prefix":"10.1007","author":[{"given":"Anna","family":"K\u00f6hne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vera","family":"Traub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Vygen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,13]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.endm.2005.05.033","volume":"19","author":"S Boyd","year":"2005","unstructured":"Boyd, S., Ellitot-Magwood, P.: Computing the integrality gap of the asymmetric traveling salesman problem. Electron. Notes Discrete Math. 19, 241\u2013247 (2005)","journal-title":"Electron. Notes Discrete Math."},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1287\/moor.1060.0191","volume":"31","author":"M Charikar","year":"2006","unstructured":"Charikar, M., Goemans, M.X., Karloff, H.: On the integrality ratio for the asymmetric traveling salesman problem. Math. Oper. Res. 31, 245\u2013252 (2006)","journal-title":"Math. Oper. Res."},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.6028\/jres.071B.032","volume":"71","author":"J Edmonds","year":"1967","unstructured":"Edmonds, J.: Optimum branchings. J. Res. Nat. Bur. Stand. B 71, 233\u2013240 (1967)","journal-title":"J. Res. Nat. Bur. Stand. B"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-540-74208-1_8","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"U Feige","year":"2007","unstructured":"Feige, U., Singh, M.: Improved approximation ratios for traveling salesperson tours and paths in directed graphs. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) APPROX\/RANDOM -2007. LNCS, vol. 4627, pp. 104\u2013118. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74208-1_8"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1287\/moor.2015.0752","volume":"41","author":"Z Friggstad","year":"2016","unstructured":"Friggstad, Z., Gupta, A., Singh, M.: An improved integrality gap for asymmetric TSP paths. Math. Oper. Res. 41, 745\u2013757 (2016)","journal-title":"Math. Oper. Res."},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"1596","DOI":"10.1137\/100797357","volume":"42","author":"Z Friggstad","year":"2013","unstructured":"Friggstad, Z., Salavatipour, M.R., Svitkina, Z.: Asymmetric traveling salesman path and directed latency problems. SIAM J. Comput. 42, 1596\u20131619 (2013)","journal-title":"SIAM J. Comput."},{"key":"22_CR7","unstructured":"Gottschalk, C.: Approximation algorithms for the traveling salesman problem in graphs and digraphs. Master\u2019s Thesis, Research Institute for Discrete Mathematics, University of Bonn (2013)"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"K\u00f6hne, A., Traub, V., Vygen, J.: The asymmetric traveling salesman path LP has constant integrality ratio. arXiv:1808.06542 (2018)","DOI":"10.1007\/978-3-030-17953-3_22"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-540-85363-3_16","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"V Nagarajan","year":"2008","unstructured":"Nagarajan, V., Ravi, R.: The directed minimum latency problem. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX\/RANDOM -2008. LNCS, vol. 5171, pp. 193\u2013206. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85363-3_16"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Svensson, O.: Approximating ATSP by relaxing connectivity. In: Proceedings of the 56th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2015), pp. 1\u201319 (2015)","DOI":"10.1109\/FOCS.2015.10"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Svensson, O., Tarnawski, J., V\u00e9gh, L.: A constant-factor approximation algorithm for the asymmetric traveling salesman problem. In: Proceedings of the 50th Annual ACM Symposium on Theory of Computing (STOC 2018), pp. 204\u2013213 (2018)","DOI":"10.1145\/3188745.3188824"}],"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-030-17953-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:43:10Z","timestamp":1709815390000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17953-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030179526","9783030179533"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17953-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 April 2019","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":"Ann Arbor, MI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/umich.edu\/~ipco2019conf\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"113","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}