Parameterized complexity and approximability of the SLCS problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

Parameterized complexity and approximability of the SLCS problem

Dates and versions

hal-00824929 , version 1 (22-05-2013)

Identifiers

Cite

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⟩
95 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More