Skip to main content

Table 1 A summary of parameterized algorithms for the problems discussed in this paper

From: Parameterized algorithms of fundamental NP-hard problems: a survey

Categories Problems Kernelization FPT algorithms
Satisfiability MaxSat   \(\surd \)
(n, 3)-MaxSAT   \(\surd \)
Spanning Trees and Out-Branching MIST \(\surd \) \(\surd \)
MIOB   \(\surd \)
Dominating Set Planar DS \(\surd \) \(\surd \)
Planar CDS \(\surd \) \(\surd \)
EDS \(\surd \) \(\surd \)
Feedback Vertex Set FVS \(\surd \) \(\surd \)
Planar FVS \(\surd \)  
Covering Vertex Cover \(\surd \) \(\surd \)
Hyperplane cover \(\surd \) \(\surd \)
Packing and matching \(P_2\) Packing \(\surd \) \(\surd \)
r-D Maching   \(\surd \)
WrDM   \(\surd \)
r-Set packing   \(\surd \)
WrSP   \(\surd \)
EDTP \(\surd \)