Go to the corresponding LIPIcs Volume Portal 
Dudek, Bartlomiej ; Gawrychowski, Pawel ; OstropolskiNalewaja, Piotr
pdfformat: 

@InProceedings{dudek_et_al:LIPIcs:2017:7345, author = {Bartlomiej Dudek and Pawel Gawrychowski and Piotr OstropolskiNalewaja}, title = {{A Family of Approximation Algorithms for the Maximum DuoPreservation String Mapping Problem}}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)}, pages = {10:110:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770392}, ISSN = {18688969}, year = {2017}, volume = {78}, editor = {Juha K{\"a}rkk{\"a}inen and Jakub Radoszewski and Wojciech Rytter}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7345}, URN = {urn:nbn:de:0030drops73458}, doi = {10.4230/LIPIcs.CPM.2017.10}, annote = {Keywords: approximation scheme, minimum common string partition, local search} }
Keywords:  approximation scheme, minimum common string partition, local search  
Seminar:  28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)  
Issue Date:  2017  
Date of publication:  28.06.2017 