A $${{10}}$$ -Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem
Tóm tắt
We study the approximability of the weighted edge-dominating set problem. Although even the unweighted case is NP-Complete, in this case a solution of size at most twice the minimum can be efficiently computed due to its close relationship with minimum maximal matching; however, in the weighted case such a nice relationship is not known to exist. In this paper, after showing that weighted edge domination is as hard to approximate as the well studied weighted vertex cover problem, we consider a natural strategy, reducing edge-dominating set to edge cover. Our main result is a simple
$$2\frac{1}{{10}}$$
-approximation algorithm for the weighted edge-dominating set problem, improving the existing ratio, due to a simple reduction to weighted vertex cover, of 2r
WVC, where r
WVC is the approximation guarantee of any polynomial-time weighted vertex cover algorithm. The best value of r
WVC currently stands at
$$2 - \frac{{\log \log \left| V \right|}}{{2\log \left| V \right|}}$$
. Furthermore we establish that the factor of
$$2\frac{1}{{10}}$$
is tight in the sense that it coincides with the integrality gap incurred by a natural linear programming relaxation of the problem.
Tài liệu tham khảo
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, “Proof verification and hardness of approximation problems,” in Proceedings of the 33rdAnnual IEEE Symposium on Foundations of Computer Science, 1992, pp. 14-23.
B. Baker, “Approximation algorithms for NP-complete problems on planar graphs,” J. ACM, vol. 41, pp. 153-180, 1994.
V. Chvátal, “A greedy heuristic for the set-covering problem,” Math. Oper. Res., vol. 4, no. 3, pp. 233-235, 1979.
J. Edmonds and E. Johnson, “Matching, a well solved class of integer linear programs,” in Combinatorial Structures and Their Applications, Gordon & Breach: New York, 1970, pp. 89-92.
U. Feige, “A threshold of ln n for approximating set cover,” in Proceedings of the 28th Annual ACM Symposium on Theory of Computing, May 1996, pp. 314-318.
M. Grötschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer, 1988.
F. Harary, Graph Theory, Addison-Wesley: Reading, MA, 1969.
D.S. Hochbaum (Ed.), Approximation Algorithms for NP-hard Problems, PWS Publishing Company: Boston, MA, 1997.
J. Horton and K. Kilakos, “Minimum edge dominating sets,” SIAM J. Discrete Math., vol. 6, no. 3, pp. 375-387, 1993.
H. Hunt III, M. Marathe, V. Radhakrishnan, S. Ravi, D. Rosenkrantz, and R. Stearns, “A unified approach to approximation schemes for NP-and PSPACE-hard problems for geometric graphs,” in Proc. 2nd Ann. European Symp. on Algorithms, 1994, pp. 424-435.
D.S. Johnson, “Approximation algorithms for combinatorial problems,” J. Comput. System Sci., vol. 9, pp. 256-278, 1974.
L. Lovász, “On the ratio of optimal integral and fractional covers,” Discrete Math., vol. 13, pp. 383-390, 1975.
S. Mitchell and S. Hedetniemi, “Edge domination in trees,” in Proc. 8th Southeastern Conf. on Combinatorics, Graph Theory, and Computing, 1977, pp. 489-509.
K.G. Murty and C. Perin, “A 1-matching blossom-type algorithm for edge covering problems,” Networks, vol. 12, pp. 379-391, 1982.
C. Papadimitriou and M. Yannakakis, “Optimization, approximation and complexity classes,” J. Comput. System Sci., vol. 43, pp. 425-440, 1991.
W.R. Pulleyblank, “Matchings and extensions,” in Handbook of Combinatorics, vol. 1, Elsevier, 1995, pp. 179-232.
A. Srinivasan, K. Madhukar, P. Nagavamsi, C.P. Rangan, and M.-S. Chang, “Edge domination on bipartite permutation graphs and cotriangulated graphs,” Information Processing Letters, vol. 56, pp. 165-171, 1995.
M. Yannakakis and F. Gavril, “Edge dominating sets in graphs,” SIAM J. Appl. Math., vol. 38, no. 3, pp. 364-372, 1980.