Table 4 Research history of FPT algorithms for Vertex Cover

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

Year	Time complexity	References
1993	\(O^*( 2^k)\)	Buss et al. [105]
1998	\(O^*( 1.324718^k)\)	Balasubramanian et al. [106]
1999	\(O^*(1.31951^k)\)	Downey et al. [107]
1999	\(O^*(1.129175^k)\)	Niedermeier et al. [108]
2001	\(O^*(1.2852^k)\)	Chen et al. [109]
2006	\(O^*(1.2738^k)\)	Chen et al. [110]

Back to article page