Sciweavers

25 search results - page 1 / 5
» The Greedy Algorithm for the Minimum Common String Partition...
Sort
View
APPROX
2004
Springer
117views Algorithms» more  APPROX 2004»
13 years 10 months ago
The Greedy Algorithm for the Minimum Common String Partition Problem
In the Minimum Common String Partition problem (MCSP) we are given two strings on input, and we wish to partition them into the same collection of substrings, minimizing the numbe...
Marek Chrobak, Petr Kolman, Jiri Sgall
ISAAC
2004
Springer
106views Algorithms» more  ISAAC 2004»
13 years 10 months ago
Minimum Common String Partition Problem: Hardness and Approximations
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
Avraham Goldstein, Petr Kolman, Jie Zheng
FAW
2010
Springer
238views Algorithms» more  FAW 2010»
13 years 3 months ago
Minimum Common String Partition Revisited
Haitao Jiang, Binhai Zhu, Daming Zhu, Hong Zhu
CIAC
2006
Springer
125views Algorithms» more  CIAC 2006»
13 years 8 months ago
On the Minimum Common Integer Partition Problem
Xin Chen, Lan Liu, Zheng Liu, Tao Jiang
APPROX
2006
Springer
126views Algorithms» more  APPROX 2006»
13 years 8 months ago
Better Approximations for the Minimum Common Integer Partition Problem
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
David P. Woodruff