论文信息 - A Primal-Dual Method for Approximating Tree Cover with Two Weights - 字舞流文

A Primal-Dual Method for Approximating Tree Cover with Two Weights

Toshihiro Fujito | Takashi Doi

[1] David S. Johnson,et al. The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.

[2] Toshihiro Fujito. On Approximability of the Independent/Connected Edge Dominating Set Problems , 2000, FSTTCS.

[3] Hiroshi Nagamochi,et al. A 2-approximation algorithm for the minimum weight edge dominating set problem , 2002, Discret. Appl. Math..

[4] Reuven Bar-Yehuda,et al. A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , 1983, WG.

[5] Ojas Parekh,et al. Improved approximations for tour and tree covers , 2000, APPROX.

[6] Carla D. Savage,et al. Depth-First Search and the Vertex Cover Problem , 1982, Inf. Process. Lett..

[7] Esther M. Arkin,et al. Approximating the Tree and Tour Covers of a Graph , 1993, Inf. Process. Lett..