Improved approximation bounds for edge dominating set in dense graphs
Theoretical Computer Science
The prize-collecting edge dominating set problem in trees
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
On totally unimodularity of edge-edge adjacency matrices
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Energy efficient joint data aggregation and link scheduling in solar sensor networks
Computer Communications
| Hi-index | 0.00 |
We prove that a generalization of the edge dominating set problem, in which each edge e needs to be covered b e times for all e∈E, admits a linear time 2-approximation for general unweighted graphs and that it can be solved optimally for weighted trees. We show how to solve it optimally in linear time for unweighted trees and for weighted trees in which b e∈{0,1} for all e∈E. Moreover, we show that it solves generalizations of weighted matching, vertex cover, and edge cover in trees.