Parameterized complexity and approximability of the SLCS problem

Sylvain Guillemot 1, 2
1 SEQUOIA - Sequential Learning
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-00824929
Contributor : Guillemot Sylvain <>
Submitted on : Wednesday, May 22, 2013 - 3:53:43 PM
Last modification on : Thursday, February 21, 2019 - 10:52:49 AM

Links full text

Identifiers

Collections

Citation

Sylvain Guillemot. Parameterized complexity and approximability of the SLCS problem. Proceedings of Parameterized and Exact Computation: Third International Workshop (IWPEC 2008), May 2008, Victoria, Canada. pp.115--128, ⟨10.1007/978-3-540-79723-4_12⟩. ⟨hal-00824929⟩

Share

Metrics

Record views

198