Skip to main content

Table 3 Research history of FPT algorithms for PDS

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

Year Time complexity References
2002 \(O^*(8^k)\) Alber et al. [74]
2002 \(O^*(2^{27\sqrt{k}})\) Kanj et al. [75]
2004 \(O^*(2^{15.13\sqrt{k}})\) Alber et al. [76]
2005 \(O^*(4^{6\sqrt{34}\sqrt{k}})\) Alber et al. [77]