An FPT Variant Of The Shadow Problem With Kernelization
Stefan Porschen · 2009
the number of vertices in F. In this paper, we discuss a variant of SIS that essentially is characterized through a different parameterization using two independent parameters, namely k as above, and s bounding the shadow size. We provide a kernelization w.r.t. this parameterization, and prove a fixed-parameter tractability bound of O(k · n 2 + p(k, s)3 k ) where p is a polynomial in the parameters k, s.