Capacitated b-Edge Dominating Set and Related Problems

@inproceedings{Berger2007CapacitatedBD,
  title={Capacitated b-Edge Dominating Set and Related Problems},
  author={Andr{\'e} Berger and Takuro Fukunaga and Hiroshi Nagamochi and Ojas Parekh},
  year={2007}
}
In this paper, we discuss the approximability of the capacitated b-edge dominating set problem, which generalizes the edge dominating set problem by introducing capacities and demands on the edges. We present an approximation algorithm for this problem and show that it achieves a factor of 8/3 for general graphs and a factor of 2 for bipartite graphs. Moreover, we discuss the relationships of the edge dominating set problem and the vertex cover problem. The results show, that improving the… CONTINUE READING

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…