{"quality_controlled":"1","ddc":["510"],"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"department":[{"_id":"HeEd"},{"_id":"UlWa"}],"year":"2022","intvolume":"       244","project":[{"call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342","name":"The Wittgenstein Prize"}],"day":"01","volume":244,"acknowledgement":"g Anna Lubiw: Supported by the Natural Sciences and Engineering Research Council of\r\nCanada (NSERC). Jayson Lynch: Supported by the Natural Sciences and Engineering Research Council of Canada (NSERC). Zuzana Masárová: Supported by Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31. Virginia Vassilevska Williams: Supported by an NSF CAREER Award, NSF Grants CCF-1528078, CCF-1514339 and CCF-1909429, a BSF Grant BSF:2012338, a Google Research Fellowship and a Sloan Research Fellowship.\r\nNicole Wein: Supported by a grant to DIMACS from the Simons Foundation (820931). This work was done while the author was at MIT.\r\nThis research was initiated at the 34th Bellairs Winter Workshop on Computational Geometry, co-organized by Erik Demaine and Godfried Toussaint, held on March 22–29,\r\n2019 in Holetown, Barbados. We thank the other participants of that workshop for providing a\r\nstimulating research environment.","author":[{"full_name":"Aichholzer, Oswin","first_name":"Oswin","last_name":"Aichholzer"},{"full_name":"Demaine, Erik D.","last_name":"Demaine","first_name":"Erik D."},{"last_name":"Korman","first_name":"Matias","full_name":"Korman, Matias"},{"last_name":"Lubiw","first_name":"Anna","full_name":"Lubiw, Anna"},{"full_name":"Lynch, Jayson","last_name":"Lynch","first_name":"Jayson"},{"first_name":"Zuzana","last_name":"Masárová","id":"45CFE238-F248-11E8-B48F-1D18A9856A87","full_name":"Masárová, Zuzana","orcid":"0000-0002-6660-1322"},{"full_name":"Rudoy, Mikhail","last_name":"Rudoy","first_name":"Mikhail"},{"last_name":"Vassilevska Williams","first_name":"Virginia","full_name":"Vassilevska Williams, Virginia"},{"full_name":"Wein, Nicole","last_name":"Wein","first_name":"Nicole"}],"conference":{"start_date":"2022-09-05","location":"Berlin/Potsdam, Germany","name":"ESA: European Symposium on Algorithms","end_date":"2022-09-09"},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.4230/LIPIcs.ESA.2022.3","article_processing_charge":"Yes","alternative_title":["LIPIcs"],"date_published":"2022-09-01T00:00:00Z","month":"09","citation":{"mla":"Aichholzer, Oswin, et al. “Hardness of Token Swapping on Trees.” <i>30th Annual European Symposium on Algorithms</i>, vol. 244, 3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.3\">10.4230/LIPIcs.ESA.2022.3</a>.","ama":"Aichholzer O, Demaine ED, Korman M, et al. Hardness of token swapping on trees. In: <i>30th Annual European Symposium on Algorithms</i>. Vol 244. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.3\">10.4230/LIPIcs.ESA.2022.3</a>","short":"O. Aichholzer, E.D. Demaine, M. Korman, A. Lubiw, J. Lynch, Z. Masárová, M. Rudoy, V. Vassilevska Williams, N. Wein, in:, 30th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.","ista":"Aichholzer O, Demaine ED, Korman M, Lubiw A, Lynch J, Masárová Z, Rudoy M, Vassilevska Williams V, Wein N. 2022. Hardness of token swapping on trees. 30th Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LIPIcs, vol. 244, 3.","ieee":"O. Aichholzer <i>et al.</i>, “Hardness of token swapping on trees,” in <i>30th Annual European Symposium on Algorithms</i>, Berlin/Potsdam, Germany, 2022, vol. 244.","chicago":"Aichholzer, Oswin, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, and Nicole Wein. “Hardness of Token Swapping on Trees.” In <i>30th Annual European Symposium on Algorithms</i>, Vol. 244. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.3\">https://doi.org/10.4230/LIPIcs.ESA.2022.3</a>.","apa":"Aichholzer, O., Demaine, E. D., Korman, M., Lubiw, A., Lynch, J., Masárová, Z., … Wein, N. (2022). Hardness of token swapping on trees. In <i>30th Annual European Symposium on Algorithms</i> (Vol. 244). Berlin/Potsdam, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.3\">https://doi.org/10.4230/LIPIcs.ESA.2022.3</a>"},"date_updated":"2024-08-12T08:53:52Z","abstract":[{"lang":"eng","text":"Given a graph where every vertex has exactly one labeled token, how can we most quickly execute a given permutation on the tokens? In (sequential) token swapping, the goal is to use the shortest possible sequence of swaps, each of which exchanges the tokens at the two endpoints of an edge of the graph. In parallel token swapping, the goal is to use the fewest rounds, each of which consists of one or more swaps on the edges of a matching. We prove that both of these problems remain NP-hard when the graph is restricted to be a tree. These token swapping problems have been studied by disparate groups of researchers in discrete mathematics, theoretical computer science, robot motion planning, game theory, and engineering. Previous work establishes NP-completeness on general graphs (for both problems), constant-factor approximation algorithms, and some poly-time exact algorithms for simple graph classes such as cliques, stars, paths, and cycles. Sequential and parallel token swapping on trees were first studied over thirty years ago (as \"sorting with a transposition tree\") and over twenty-five years ago (as \"routing permutations via matchings\"), yet their complexities were previously unknown. We also show limitations on approximation of sequential token swapping on trees: we identify a broad class of algorithms that encompass all three known polynomial-time algorithms that achieve the best known approximation factor (which is 2) and show that no such algorithm can achieve an approximation factor less than 2."}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file_date_updated":"2024-08-12T08:51:44Z","corr_author":"1","has_accepted_license":"1","article_number":"3","title":"Hardness of token swapping on trees","external_id":{"arxiv":["2103.06707"]},"date_created":"2024-05-29T06:27:16Z","file":[{"content_type":"application/pdf","date_created":"2024-08-12T08:51:44Z","success":1,"date_updated":"2024-08-12T08:51:44Z","file_name":"2022_LIPIcS_Aichholzer.pdf","file_id":"17420","access_level":"open_access","file_size":1406071,"creator":"dernst","checksum":"a1fbd3e7baad510fbcb998cf4a7d9f7f","relation":"main_file"}],"license":"https://creativecommons.org/licenses/by/4.0/","status":"public","_id":"17084","publication":"30th Annual European Symposium on Algorithms","type":"conference","language":[{"iso":"eng"}],"publication_status":"published","oa_version":"Published Version"}