IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v5y2001i3d10.1023_a1011445210568.html
   My bibliography  Save this article

A $${{10}}$$ -Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem

Author

Listed:
  • Robert Carr

    (Sandia National Laboratory)

  • Toshihiro Fujito

    (Nagoya University Furo)

  • Goran Konjevod

    (Carnegie Mellon University)

  • Ojas Parekh

    (Carnegie Mellon University)

Abstract

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 natural strategy, reducing edge-dominating set to edge cover. Our main result is a simple $$2\frac{1}{{10}}$$ -approximation algorithm for the weighted edge-dominating set problem, improving the existing ratio, due to a simple reduction to weighted vertex cover, of 2r WVC, where r WVC is the approximation guarantee of any polynomial-time weighted vertex cover algorithm. The best value of r WVC currently stands at $$2 - \frac{{\log \log \left| V \right|}}{{2\log \left| V \right|}}$$ . Furthermore we establish that the factor of $$2\frac{1}{{10}}$$ is tight in the sense that it coincides with the integrality gap incurred by a natural linear programming relaxation of the problem.

Suggested Citation

  • Robert Carr & Toshihiro Fujito & Goran Konjevod & Ojas Parekh, 2001. "A $${{10}}$$ -Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem," Journal of Combinatorial Optimization, Springer, vol. 5(3), pages 317-326, September.
    • Handle: RePEc:spr:jcomop:v:5:y:2001:i:3:d:10.1023_a:1011445210568
    DOI: 10.1023/A:1011445210568
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1011445210568
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1011445210568?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Miroslav Chlebík & Janka Chlebíková, 2006. "Approximation hardness of edge dominating set problems," Journal of Combinatorial Optimization, Springer, vol. 11(3), pages 279-290, May.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:5:y:2001:i:3:d:10.1023_a:1011445210568. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.