论文信息 - A Modification of the Greedy Algorithm for Vertex Cover - 字舞流文

A Modification of the Greedy Algorithm for Vertex Cover

Kenneth L. Clarkson | K. Clarkson

[1] Dorit S. Hochbaum,et al. Efficient bounds for the stable set, vertex cover and set packing problems , 1983, Discret. Appl. Math..

[2] Reuven Bar-Yehuda,et al. A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem , 1981, J. Algorithms.

[3] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[4] László Lovász,et al. On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[5] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.

[6] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.