Bartlomiej Dudek, Pawel Gawrychowski, Piotr Ostropolski-Nalewaja. A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem. In Juha Kärkkäinen, Jakub Radoszewski, Wojciech Rytter, editors, 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland. Volume 78 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]
@inproceedings{DudekGO17,
title = {A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem},
author = {Bartlomiej Dudek and Pawel Gawrychowski and Piotr Ostropolski-Nalewaja},
year = {2017},
doi = {10.4230/LIPIcs.CPM.2017.10},
url = {https://doi.org/10.4230/LIPIcs.CPM.2017.10},
researchr = {https://researchr.org/publication/DudekGO17},
cites = {0},
citedby = {0},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland},
editor = {Juha Kärkkäinen and Jakub Radoszewski and Wojciech Rytter},
volume = {78},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-039-2},
}