Minimum common string partition problem: hardness and approximations

From MaRDI portal
Publication:2571293

zbMath1102.68139MaRDI QIDQ2571293

Avraham Goldstein, Petr Kolman, Jie Zheng

Publication date: 1 November 2005

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/126825




Related Items (13)






This page was built for publication: Minimum common string partition problem: hardness and approximations