[1]Marco Cesati. Compendium of parameterized problems[M]. 2006. [2]Balasubramanian R, Fellows M R, Raman V. An improved fixed parameter algorithm for vertex cover [J]. Information Processing Letters, 1998, 65(3): 163-168. [3]J Chen, I Kanj. Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms[J]. Journal of Computer and System Sciences, 2003, 67(4): 833-847. [4]Chen J, Kanj I, Jia W. Vertex cover: further observation and further improvements[J]. Journal of Algorithms, 2001, 41(2): 280-301. [5]Niedermeier R, Rossmanith P. On efficient fixed parameter algorithms for weighted vertex cover[J]. Journal of Algorithms, 2003, 47(2): 63-77. [6]Stege U, Fellows M R. An improved fixed-parameter-tractable algorithm for vertex cover[R]. Technical Report 318, Department of Computer Science, ETH Zurich Apr. 1999. [7]Fomin F V, Grandoni, Kratsch D. Measure and conquer: a simple O(20.288n) independent set algorithm[C]. Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithm, 2006, 18-25. [8]Garey M, Johnson D. Computers and intractability: a guide to the theory of NP-completeness[M]. San Francisco: W.H. Freeman and company, 1979. [9]Fomin F V, Grandoni F, Kratsch D. Measure and conquer: domination a case study[C]. Proceedings of the 32nd International Colloquium on Automata, Languages and Programming , 2005, 191-203. [10]马振宇.加权分治技术在Set Packing问题中的应用与研究[D].硕士学位论文,中南大学,2007. [11]石磊. 使用度量与分治方法分析和设计精确算法[D].硕士学位论文,上海交通大学,2010. [12]Alber J, Fan H, Fellows M R, et al. A refined search tree technique for dominating set on planar graphs[J]. Journal of Computer and Sciences, 2005, 71(4): 385-405. [13]Saket Saurabh. Exact algorithms for optimization and parameterized versions of some graph theoretic problems[D]. Homi Bhabha National Institute, 2008. [14]Ning Ai-bing, Ma Liang, Xiong Xiao-hua. Fast reduction algorithm for minimum vertex cover problem[J]. Journal of Chinese Computer Systems. 2008. 29(4): 1282-1285. |