A Better Approximation Ratio for the Vertex Cover Problem
暂无分享,去创建一个
[1] Gaston H. Gonnet,et al. On the LambertW function , 1996, Adv. Comput. Math..
[2] Reuven Bar-Yehuda,et al. A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , 1983, WG.
[3] Irit Dinur,et al. The importance of being biased , 2002, STOC '02.
[4] Satish Rao,et al. Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.
[5] Jon M. Kleinberg,et al. The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover , 1998, SIAM J. Discret. Math..
[6] Amit Agarwal,et al. O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems , 2005, STOC '05.
[7] Moses Charikar,et al. On semidefinite programming relaxations for graph coloring and vertex cover , 2002, SODA '02.
[8] Eran Halperin,et al. Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs , 2000, SODA '00.
[9] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[10] Ewald Speckenmeyer,et al. Ramsey numbers and an approximation algorithm for the vertex cover problem , 1985, Acta Informatica.
[11] James R. Lee,et al. On distance scales, embeddings, and efficient relaxations of the cut cone , 2005, SODA '05.