Theory of linear and integer programming
Theory of linear and integer programming
Combinatorial optimization
From graphs to Euclidean virtual worlds: visualization of 3D electronic institutions
ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
Path hitting in acyclic graphs
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Approximability of the capacitated b-edge dominating set problem
Theoretical Computer Science
Approximation algorithms for partially covering with edges
Theoretical Computer Science
An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
The prize-collecting edge dominating set problem in trees
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
How to trim an MST: a 2-approximation algorithm for minimum cost tree cover
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Linear time algorithms for generalized edge dominating set problems
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
How to trim a MST: A 2-Approximation algorithm for minimum cost-tree cover
ACM Transactions on Algorithms (TALG)
EDGE DOMINATING SET: efficient enumeration-based exact algorithms
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Generalizing the induced matching by edge capacity constraints
Discrete Optimization
| Hi-index | 0.00 |
The weighted edge dominating set problem (EDS) generalizes both the weighted vertex cover problem and the problem of covering the edges of graph by a minimum cost set of both vertices and edges. Although EDS was proven NP-complete in 1980, not much progress had been made in improving its approximability to match that of weighted vertex cover until 2000. In this paper we develop a 2-approximation for weighted EDS by honing the technique of a recent 2 1/10-approximation which exploits the close polyhedral relationship between EDS and the edge cover problem. For the sake of completeness we also present a new direct proof of Edmonds and Johnson's characterization of the edge cover polyhedron. Our approximation guarantee is tight in the sense that the existence of a (2-ε)-approximation for weighted EDS for some constant, ε would imply a (2-ε)-approximation for weighted vertex cover, constituting a major breakthrough in the field.