Linear Time Algorithms for Generalized Edge Dominating Set Problems

[1]  Ojas Parekh,et al.  Erratum to: Linear Time Algorithms for Generalized Edge Dominating Set Problems , 2008, Algorithmica.

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

[3]  Ojas Parekh,et al.  Edge dominating and hypomatchable sets , 2002, SODA '02.

[4]  Robert D. Carr,et al.  A $${{10}}$$ -Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem , 2001, J. Comb. Optim..

[5]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[6]  Toshihiro Fujito,et al.  On approximability of the independent/connected edge dominating set problems , 2000, Inf. Process. Lett..

[7]  Robert Preis,et al.  Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs , 1999, STACS.

[8]  C. Pandu Rangan,et al.  Edge Domination on Bipartite Permutation Graphs and Cotriangulated Graphs , 1995, Inf. Process. Lett..

[9]  Joseph Douglas Horton,et al.  Minimum Edge Dominating Sets , 1993, SIAM J. Discret. Math..

[10]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[11]  Mihalis Yannakakis,et al.  Edge Dominating Sets in Graphs , 1980 .

[12]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[13]  Ojas Parekh,et al.  Polyhedral techniques for graphic covering problems , 2002 .

[14]  Shiow-Fen Hwang,et al.  The edge domination problem , 1995, Discuss. Math. Graph Theory.

[15]  S. Mitchell.  Edge domination in trees , 1977 .

[16]  Frank Harary,et al.  Graph Theory , 2016 .