Minimum Common String Partition Problem: Hardness and Approximations

Avraham Goldstein, Petr Kolman, Jie Zheng. Minimum Common String Partition Problem: Hardness and Approximations. In Rudolf Fleischer, Gerhard Trippen, editors, Algorithms and Computation, 15th International Symposium, ISAAC 2004, HongKong, China, December 20-22, 2004, Proceedings. Volume 3341 of Lecture Notes in Computer Science, pages 484-495, Springer, 2004. [doi]

Abstract

Abstract is missing.