Improved Approximation Algorithms for the Partial Vertex Cover Problem
暂无分享,去创建一个
[1] Eran Halperin,et al. Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs , 2000, SODA '00.
[2] Nader H. Bshouty,et al. Massaging a Linear Programming Solution to Give a 2-Approximation for a Generalization of the Vertex Cover Problem , 1998, STACS.
[3] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .
[4] Dorit S. Hochbaum,et al. The t-Vertex Cover Problem: Extending the Half Integrality Framework with Budget Constraints , 1998, APPROX.
[5] David R. Karger,et al. Approximate graph coloring by semidefinite programming , 1998, JACM.
[6] Aravind Srinivasan,et al. Distributions on level-sets with applications to approximation algorithms , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[7] S. Khuller,et al. Approximation algorithms for partial covering problems , 2001, J. Algorithms.
[8] Uri Zwick,et al. Coloring k-colorable graphs using smaller palettes , 2001, SODA '01.
[9] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1951 .
[10] Reuven Bar-Yehuda,et al. Using homogenous weights for approximating the partial cover problem , 2001, SODA '99.