1. Berger, A., Fukunaga, T., Nagamochi, H., Parekh, O.: Capacitated b-edge dominating set and related problems. Manuscript (2005)
2. Carr, R., Fujito, T., Konjevod, G., Parekh, O.: A 2 1/10-approximation algorithm for a generalization of the weighted edge-dominating set problem. J. Comb. Optim. 5, 317–326 (2001)
3. Fricke, G., Laskar, R.: Strong matchings on trees. In: Proceedings of the Twenty-third Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, FL, 1992, vol. 89, pp. 239–243 (1992)
4. Fujito, T.: On approximability of the independent/connected edge dominating set problems. Inf. Process. Lett. 79(6), 261–266 (2001)
5. Fujito, T., Nagamochi, H.: A 2-approximation algorithm for the minimum weight edge dominating set problem. Discrete Appl. Math. 118(3), 199–207 (2002)