{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:12:35Z","timestamp":1742980355742,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030865924"},{"type":"electronic","value":"9783030865931"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86593-1_4","type":"book-chapter","created":{"date-parts":[[2021,9,11]],"date-time":"2021-09-11T20:26:28Z","timestamp":1631391988000},"page":"53-66","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["From Symmetry to Asymmetry: Generalizing TSP Approximations by\u00a0Parametrization"],"prefix":"10.1007","author":[{"given":"Lukas","family":"Behrendt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katrin","family":"Casel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Friedrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. A.","family":"Gregor\u00a0Lagodzinski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"L\u00f6ser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcus","family":"Wilhelm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,9]]},"reference":[{"key":"4_CR1","first-page":"645","volume":"111","author":"D Applegate","year":"1998","unstructured":"Applegate, D., Bixby, R., Cook, W., Chv\u00e1tal, V.: On the solution of traveling salesman problems. Doc. Math. 111, 645\u2013656 (1998)","journal-title":"Doc. Math."},{"issue":"4","key":"4_CR2","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., Madry, A., Gharan, S.O., Saberi, A.: An O(log n\/log log n)-approximation algorithm for the asymmetric traveling salesman problem. Oper. Res. 65(4), 1043\u20131061 (2017). https:\/\/doi.org\/10.1287\/opre.2017.1603","journal-title":"Oper. Res."},{"key":"4_CR3","unstructured":"Behrendt, L., Casel, K., Friedrich, T., Lagodzinski, J.A.G., L\u00f6ser, A., Wilhelm, M.: From symmetry to asymmetry: generalizing TSP approximations by parametrization. CoRR abs\/1911.02453 (2019). http:\/\/arxiv.org\/abs\/1911.02453"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"van Bevern, R., Slugina, V.A.: A historical note on the 3\/2-approximation algorithm for the metric traveling salesman problem. Hist. Math. 53, 118\u2013127 (2020). https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0315086020300240","DOI":"10.1016\/j.hm.2020.04.003"},{"issue":"4","key":"4_CR5","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/j.jda.2005.07.004","volume":"4","author":"M Bl\u00e4ser","year":"2006","unstructured":"Bl\u00e4ser, M., Manthey, B., Sgall, J.: An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality. J. Discret. Algorithms 4(4), 623\u2013632 (2006). https:\/\/doi.org\/10.1016\/j.jda.2005.07.004","journal-title":"J. Discret. Algorithms"},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(01)00287-0","volume":"285","author":"H B\u00f6ckenhauer","year":"2002","unstructured":"B\u00f6ckenhauer, H., Hromkovic, J., Klasing, R., Seibert, S., Unger, W.: Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. Theor. Comput. Sci. 285(1), 3\u201324 (2002). https:\/\/doi.org\/10.1016\/S0304-3975(01)00287-0","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"4_CR7","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s00224-007-1347-x","volume":"41","author":"H B\u00f6ckenhauer","year":"2007","unstructured":"B\u00f6ckenhauer, H., Hromkovic, J., Kneis, J., Kupke, J.: The parameterized approximability of TSP with deadlines. Theor. Comput. Sci. 41(3), 431\u2013444 (2007). https:\/\/doi.org\/10.1007\/s00224-007-1347-x","journal-title":"Theor. Comput. Sci."},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.jcss.2017.09.009","volume":"92","author":"\u00c9 Bonnet","year":"2018","unstructured":"Bonnet, \u00c9., Lampis, M., Paschos, V.T.: Time-approximation trade-offs for inapproximable problems. J. Comput. Syst. Sci. 92, 171\u2013180 (2018). https:\/\/doi.org\/10.1016\/j.jcss.2017.09.009","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/3-540-45841-7_18","volume-title":"STACS 2002","author":"LS Chandran","year":"2002","unstructured":"Chandran, L.S., Ram, L.S.: Approximations for ATSP with parametrized triangle inequality. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 227\u2013237. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45841-7_18"},{"key":"4_CR10","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report 388, Graduate School of Industrial Administration, Carnegie Mellon University (1976)"},{"key":"4_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"issue":"5","key":"4_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.entcs.2011.06.003","volume":"264","author":"B Dezs\u0151","year":"2011","unstructured":"Dezs\u0151, B., J\u00fcttner, A., Kov\u00e1cs, P.: LEMON - an open source C++ graph template library. Electron. Notes Theor. Comput. Sci. 264(5), 23\u201345 (2011). https:\/\/doi.org\/10.1016\/j.entcs.2011.06.003","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"4","key":"4_CR13","doi-asserted-by":"publisher","first-page":"233","DOI":"10.6028\/jres.071B.032","volume":"71B","author":"J Edmonds","year":"1967","unstructured":"Edmonds, J.: Optimum branchings. J. Res. Natl. Bur. Stan. Sect. B Math. Math. Phys. 71B(4), 233 (1967)","journal-title":"J. Res. Natl. Bur. Stan. Sect. B Math. Math. Phys."},{"key":"4_CR14","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"},{"issue":"2","key":"4_CR15","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF02579168","volume":"6","author":"HN Gabow","year":"1986","unstructured":"Gabow, H.N., Galil, Z., Spencer, T.H., Tarjan, R.E.: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica 6(2), 109\u2013122 (1986). https:\/\/doi.org\/10.1007\/BF02579168","journal-title":"Combinatorica"},{"key":"4_CR16","unstructured":"Hagberg, A., Schult, D., Swart, P.: Exploring network structure, dynamics, and function using NetworkX. In: Proceedings of the 7th Python in Science Conference, pp. 11\u201315 (2008). http:\/\/conference.scipy.org\/proceedings\/SciPy2008\/paper_2\/"},{"issue":"1","key":"4_CR17","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M Held","year":"1962","unstructured":"Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. J. Soc. Ind. Appl. Math. 10(1), 196\u2013210 (1962)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"4_CR18","unstructured":"Henry-Labord\u00e8re, A.L.: The record balancing problem: a dynamic programming solution of a generalized traveling salesman problem. RAIRO B-2, 43\u201349 (1969)"},{"issue":"5","key":"4_CR19","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0167-6377(91)90016-I","volume":"10","author":"JA Hoogeveen","year":"1991","unstructured":"Hoogeveen, J.A.: Analysis of Christofides\u2019 heuristic: some paths are more difficult than cycles. Oper. Res. Lett. 10(5), 291\u2013295 (1991). https:\/\/doi.org\/10.1016\/0167-6377(91)90016-I","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"4_CR20","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0167-6377(83)90048-2","volume":"2","author":"R Jonker","year":"1983","unstructured":"Jonker, R., Volgenant, T.: Transforming asymmetric into symmetric traveling salesman problems. Oper. Res. Lett. 2(4), 161\u2013163 (1983)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"4_CR21","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0167-6377(86)90081-7","volume":"5","author":"R Jonker","year":"1986","unstructured":"Jonker, R., Volgenant, T.: Transforming asymmetric into symmetric traveling salesman problems: erratum. Oper. Res. Lett. 5(4), 215\u2013216 (1986)","journal-title":"Oper. Res. Lett."},{"key":"4_CR22","doi-asserted-by":"publisher","unstructured":"Karlin, A., Klein, N., Gharan, S.O.: A (slightly) improved approximation algorithm for metric TSP. In: Khuller, S., Williams, V.V. (eds.) Proceedings of the STOC 2021, pp. 32\u201345. ACM (2021). https:\/\/doi.org\/10.1145\/3406325.3451009","DOI":"10.1145\/3406325.3451009"},{"issue":"8","key":"4_CR23","doi-asserted-by":"publisher","first-page":"1665","DOI":"10.1016\/j.jcss.2015.06.003","volume":"81","author":"M Karpinski","year":"2015","unstructured":"Karpinski, M., Lampis, M., Schmied, R.: New inapproximability bounds for TSP. J. Comput. Syst. Sci. 81(8), 1665\u20131677 (2015). https:\/\/doi.org\/10.1016\/j.jcss.2015.06.003","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-319-98355-4_22","volume-title":"Adventures Between Lower Bounds and Higher Altitudes","author":"R Klasing","year":"2018","unstructured":"Klasing, R., M\u00f6mke, T.: A modern view on stability of approximation. In: B\u00f6ckenhauer, H.-J., Komm, D., Unger, W. (eds.) Adventures Between Lower Bounds and Higher Altitudes. LNCS, vol. 11011, pp. 393\u2013408. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98355-4_22"},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-642-03367-4_41","volume-title":"Algorithms and Data Structures","author":"\u0141 Kowalik","year":"2009","unstructured":"Kowalik, \u0141, Mucha, M.: Two approximation algorithms for ATSP with strengthened triangle inequality. In: Dehne, F., Gavrilova, M., Sack, J.-R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol. 5664, pp. 471\u2013482. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03367-4_41"},{"issue":"1","key":"4_CR26","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1093\/comjnl\/bxm048","volume":"51","author":"D Marx","year":"2008","unstructured":"Marx, D.: Parameterized complexity and approximation algorithms. Comput. J. 51(1), 60\u201378 (2008). https:\/\/doi.org\/10.1093\/comjnl\/bxm048","journal-title":"Comput. J."},{"key":"4_CR27","doi-asserted-by":"publisher","unstructured":"Marx, D., Salmasi, A., Sidiropoulos, A.: Constant-factor approximations for asymmetric TSP on nearly-embeddable graphs. In: Proceedings of APPROX\/RANDOM 2016, pp. 16:1\u201316:54. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016). https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2016.16","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2016.16"},{"issue":"11951","key":"4_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-019-48463-z","volume":"9","author":"JCM Mori","year":"2019","unstructured":"Mori, J.C.M., Samaranayake, S.: Bounded asymmetry in road networks. Sci. Rep. 9(11951), 1\u20139 (2019). https:\/\/doi.org\/10.1038\/s41598-019-48463-z","journal-title":"Sci. Rep."},{"issue":"4","key":"4_CR29","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB\u2013a traveling salesman problem library. INFORMS J. Comput. 3(4), 376\u2013384 (1991). https:\/\/doi.org\/10.1287\/ijoc.3.4.376","journal-title":"INFORMS J. Comput."},{"issue":"7","key":"4_CR30","doi-asserted-by":"publisher","first-page":"1566","DOI":"10.1016\/j.cor.2011.09.005","volume":"39","author":"A Rodr\u00edguez","year":"2012","unstructured":"Rodr\u00edguez, A., Ruiz, R.: The effect of the asymmetry of road transportation networks on the traveling salesman problem. Comput. Oper. Res. 39(7), 1566\u20131576 (2012). https:\/\/doi.org\/10.1016\/j.cor.2011.09.005","journal-title":"Comput. Oper. Res."},{"key":"4_CR31","first-page":"185","volume":"8","author":"JP Saksena","year":"1970","unstructured":"Saksena, J.P.: Mathematical model of scheduling clients through welfare agencies. Comput. Oper. Res. J. 8, 185\u2013200 (1970)","journal-title":"Comput. Oper. Res. J."},{"issue":"6","key":"4_CR32","doi-asserted-by":"publisher","first-page":"37:1","DOI":"10.1145\/3424306","volume":"67","author":"O Svensson","year":"2020","unstructured":"Svensson, O., Tarnawski, J., V\u00e9gh, L.A.: A constant-factor approximation algorithm for the asymmetric traveling salesman problem. J. ACM 67(6), 37:1-37:53 (2020). https:\/\/doi.org\/10.1145\/3424306","journal-title":"J. ACM"},{"key":"4_CR33","doi-asserted-by":"publisher","unstructured":"Traub, V., Vygen, J.: An improved approximation algorithm for ATSP. In: Proceedings of STOC 2020, pp. 1\u201313. ACM (2020). https:\/\/doi.org\/10.1145\/3357713.3384233","DOI":"10.1145\/3357713.3384233"},{"issue":"2\u20133","key":"4_CR34","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.jalgor.2008.10.002","volume":"64","author":"T Zhang","year":"2009","unstructured":"Zhang, T., Li, W., Li, J.: An improved approximation algorithm for the ATSP with parameterized triangle inequality. J. Algorithms 64(2\u20133), 74\u201378 (2009). https:\/\/doi.org\/10.1016\/j.jalgor.2008.10.002","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86593-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,11]],"date-time":"2021-09-11T20:27:45Z","timestamp":1631392065000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86593-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030865924","9783030865931"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86593-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.corelab.ntua.gr\/fct2021\/","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":"94","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":"30","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":"32% - 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":"8.54","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic. There are papers of 2 invited talks also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}