Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem

DOI10.1007/978-3-642-22616-8_24zbMath1342.68366OpenAlexW1008706668MaRDI QIDQ5199158

Bin Fu, Boting Yang, Haitao Jiang, Binhai Zhu

Publication date: 12 August 2011

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22616-8_24

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32)

Related Items (2)

Mathematical programming strategies for solving the minimum common string partition problem ⋮ Computational performance evaluation of two integer linear programming models for the minimum common string partition problem

This page was built for publication: Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem