A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem

Bartłomiej DudekBartłomiej Dudek, Paweł GawrychowskiPaweł Gawrychowski, Piotr Ostropolski-NalewajaPiotr Ostropolski-Nalewaja

ISBN: 978-3-95977-039-2
ISSN: 1868-8969
DOI Link

Bartłomiej Dudek, Paweł Gawrychowski, Piotr Ostropolski-Nalewaja
A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem
In Juha Kärkkäinen and Jakub Radoszewski and Wojciech Rytter, eds., 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), volume 78, 10:1-10:14, 2017. CPM 2017

Details
Bibtex

Forschungsgruppe:Research Group: Computational LogicComputational Logic

@inproceedings{DGO2017,
  author    = {Bart{\l}omiej Dudek and Pawe{\l} Gawrychowski and Piotr
               Ostropolski-Nalewaja},
  title     = {A Family of Approximation Algorithms for the Maximum
               Duo-Preservation String Mapping Problem},
  editor    = {Juha K{\"{a}}rkk{\"{a}}inen and Jakub Radoszewski and Wojciech
               Rytter},
  booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM
               2017)},
  volume    = {78},
  publisher = {CPM 2017},
  year      = {2017},
  pages     = {10:1-10:14},
  doi       = {10.4230/LIPIcs.CPM.2017.10}
}