scientific article; zbMATH DE number 7203315

DOI10.4230/LIPIcs.CPM.2017.10zbMath1434.68732arXiv1702.02405MaRDI QIDQ5110874

Piotr Ostropolski-Nalewaja, Paweł Gawrychowski, Bartłomiej Dudek

Publication date: 25 May 2020

Full work available at URL: https://arxiv.org/abs/1702.02405

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

local searchapproximation schememinimum common string partition

Mathematics Subject Classification ID

Approximation algorithms (68W25) Algorithms on strings (68W32)

Related Items

Revisiting the parameterized complexity of maximum-duo preservation string mapping, A \((1.4+\epsilon)\)-approximation algorithm for the 2-\textsc{Max-Duo} problem, Unnamed Item