Constrained LCS: Hardness and Approximation

Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein. Constrained LCS: Hardness and Approximation. In Paolo Ferragina, Gad M. Landau, editors, Combinatorial Pattern Matching, 19th Annual Symposium, CPM 2008, Pisa, Italy, June 18-20, 2008, Proceedings. Volume 5029 of Lecture Notes in Computer Science, pages 255-262, Springer, 2008. [doi]

Authors

Zvi Gotthilf

This author has not been identified. Look up 'Zvi Gotthilf' in Google

Danny Hermelin

This author has not been identified. Look up 'Danny Hermelin' in Google

Moshe Lewenstein

This author has not been identified. Look up 'Moshe Lewenstein' in Google