Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Marek Chrobak, Petr Kolman, Jiri Sgall. The greedy algorithm for the minimum common string partition problem. ACM Transactions on Algorithms, 1(2):350-366, 2005. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: The Greedy Algorithm for the Minimum Common String Partition ProblemMarek Chrobak, Petr Kolman, Jiri Sgall. approx 2004: 84-95 [doi] Minimum Common String Partition Problem: Hardness and ApproximationsAvraham Goldstein, Petr Kolman, Jie Zheng. isaac 2004: 484-495 [doi] Minimum Common String Partition Problem: Hardness and ApproximationsAvraham Goldstein, Petr Kolman, Jie Zheng. combinatorics, 12, 2005. [doi]
The following publications are possibly variants of this publication: