Počet záznamů: 1
The greedy algorithm for the minimum common string partition problem
- 1.Sgall, Jiří - Kolman, P. - Chrobak, M.
The greedy algorithm for the minimum common string partition problem.
Proceedings of the APPROX. Berlin: Springer, 2004, s. 84-95.
[Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems/7./, APPROX 2004, and International Workshop on Randomization and Computation/8./, RANDOM 2004. Cambridge (US), 22.08.2004-24.08.2004]
http://hdl.handle.net/11104/0014093
Počet záznamů: 1