@InProceedings{miltzow_et_al:LIPIcs.ESA.2016.66,
author = {Miltzow, Tillmann and Narins, Lothar and Okamoto, Yoshio and Rote, G\"{u}nter and Thomas, Antonis and Uno, Takeaki},
title = {{Approximation and Hardness of Token Swapping}},
booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)},
pages = {66:1--66:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-015-6},
ISSN = {1868-8969},
year = {2016},
volume = {57},
editor = {Sankowski, Piotr and Zaroliagis, Christos},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.66},
URN = {urn:nbn:de:0030-drops-64084},
doi = {10.4230/LIPIcs.ESA.2016.66},
annote = {Keywords: token swapping, minimum generator sequence, graph theory, NP-hardness, approximation algorithms}
}