A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem

@inproceedings{Carr2000A21,
  title={A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem},
  author={Robert D. Carr and Toshihiro Fujito and Goran Konjevod and Ojas Parekh},
  booktitle={ESA},
  year={2000}
}
We study the approximability of the weighted edge-dominating set problem. Although even the unweighted case is NP-Complete, in this case a solution of size at most twice the minimum can be efficiently computed due to its close relationship with minimum maximal matching; however, in the weighted case such a nice relationship is not known to exist. In this paper, after showing that weighted edge domination is as hard to approximate as the well studied weighted vertex cover problem, we consider a… CONTINUE READING

Figures and Topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
SHOWING 1-10 OF 36 CITATIONS

Approximation hardness of edge dominating set problems

VIEW 6 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Parameterized Algorithmics: A Graph-Theoretic Approach

VIEW 6 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

A 2-approximation algorithm for the minimum weight edge dominating set problem

  • Discrete Applied Mathematics
  • 2002
VIEW 6 EXCERPTS
CITES METHODS & BACKGROUND

edge dominating set: Efficient Enumeration-Based Exact Algorithms

VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-10 OF 18 REFERENCES

Approximation Algorithms for NP-hard Problems

D. S. Ho hbaum, editor
  • 1997

Mat hings and extensions

W. R. Pulleyblank
  • In Handbook of ombinatori s, volume 1, pages 179{232. Elsevier,
  • 1995

Approximation algorithms for NP- omplete problems on planar graphs

B. Baker
  • J. ACM, 41:153{180,
  • 1994
VIEW 1 EXCERPT

and R

H. Hunt, M. Marathe, V. Radhakrishnan, S. Ravi, D. Rosenkrantz
  • Stearns. A uni ed approa h to approximation s hemes for NP- and PSPACE hard problems for geometri graphs. In Pro . 2nd Ann. European Symp. on Algo rithms, pages 424{435,
  • 1994

Proof verification and hardness of approximation problems

  • Proceedings., 33rd Annual Symposium on Foundations of Computer Science
  • 1992
VIEW 1 EXCERPT

ots hel, L

M. Gr
  • Lov asz, and A. S hrijver. Geometri Algorithms and Combinato rial Optimization. Springer,
  • 1988