The Greedy Algorithm for the Minimum Common String Partition Problem

Marek Chrobak, Petr Kolman, Jiri Sgall. The Greedy Algorithm for the Minimum Common String Partition Problem. In Klaus Jansen, Sanjeev Khanna, José D. P. Rolim, Dana Ron, editors, Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Compu. Volume 3122 of Lecture Notes in Computer Science, pages 84-95, Springer, 2004. [doi]

@inproceedings{ChrobakKS04,
  title = {The Greedy Algorithm for the Minimum Common String Partition Problem},
  author = {Marek Chrobak and Petr Kolman and Jiri Sgall},
  year = {2004},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3122&spage=84},
  tags = {partitioning},
  researchr = {https://researchr.org/publication/ChrobakKS04},
  cites = {0},
  citedby = {0},
  pages = {84-95},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Compu},
  editor = {Klaus Jansen and Sanjeev Khanna and José D. P. Rolim and Dana Ron},
  volume = {3122},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-22894-2},
}