A $${{10}}$$ -Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem
暂无分享,去创建一个
Robert D. Carr | Ojas Parekh | Toshihiro Fujito | Goran Konjevod | Ojas D. Parekh | R. Carr | G. Konjevod | Toshihiro Fujito
[1] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .
[2] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[3] Frank Harary,et al. Graph Theory , 2016 .
[4] Mihalis Yannakakis,et al. Edge Dominating Sets in Graphs , 1980 .
[5] C. Pandu Rangan,et al. Edge Domination on Bipartite Permutation Graphs and Cotriangulated Graphs , 1995, Inf. Process. Lett..
[6] Jack Edmonds,et al. Matching: A Well-Solved Class of Integer Linear Programs , 2001, Combinatorial Optimization.
[7] Katta G. Murty,et al. A 1-matching blossom-type algorithm for edge covering problems , 1982, Networks.
[8] László Lovász,et al. On the ratio of optimal integral and fractional covers , 1975, Discret. Math..
[9] Harry B. Hunt,et al. A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs , 1994, ESA.
[10] Joseph Douglas Horton,et al. Minimum Edge Dominating Sets , 1993, SIAM J. Discret. Math..
[11] J. G. Pierce,et al. Geometric Algorithms and Combinatorial Optimization , 2016 .
[12] W. Pulleyblank. Matchings and extensions , 1996 .
[13] Dorit S. Hochba,et al. Approximation Algorithms for NP-Hard Problems , 1997, SIGA.
[14] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.
[15] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..
[16] Brenda S. Baker,et al. Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[17] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.