A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem
暂无分享,去创建一个
[1] Reuven Bar-Yehuda,et al. On approximating a vertex cover for planar graphs , 1982, STOC '82.
[2] Avi Wigderson,et al. Improving the performance guarantee for approximate graph coloring , 1983, JACM.
[3] H. Djidjev. On the Problem of Partitioning Planar Graphs , 1982 .
[4] Alon Itai,et al. Finding a Minimum Circuit in a Graph , 1978, SIAM J. Comput..
[5] Dorit S. Hochbaum,et al. Approximation Algorithms for the Set Covering and Vertex Cover Problems , 1982, SIAM J. Comput..
[6] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.
[7] Reuven Bar-Yehuda,et al. A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem , 1981, J. Algorithms.
[8] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..
[9] Zvi Galil,et al. A new algorithm for the maximal flow problem , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[10] Ewald Speckenmeyer,et al. Some Further Approximation Algorithms for the Vertex Cover Problem , 1983, CAAP.
[11] Leslie E. Trotter,et al. Vertex packings: Structural properties and algorithms , 1975, Math. Program..
[12] Norishige Chiba,et al. Applications of the Lipton and Tarjan's Planar Separator Theorem , 1981 .
[13] Dorit S. Hochbaum,et al. Efficient bounds for the stable set, vertex cover and set packing problems , 1983, Discret. Appl. Math..