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

The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent Set

Author

Listed:
  • H.Y. Lau

    (The University of Hong Kong)

  • H.F. Ting

    (The University of Hong Kong)

Abstract

The classical greedy heuristic for approximating maximum independent set is simple and efficient. It achieves a performance ratio of (Δ + 2)/3, where Δ is the maximum node degree of the input graph. All known algorithms for the problem with better performance ratios are much more complicated and inefficient. In this paper, we propose a natural extension of the greedy heuristic. It is as simple and as efficient as the classical greedy heuristic. By a careful analysis on the structure of the intermediate graphs manipulated by our heuristic, we prove that the performance ratio is improved to (Δ + 3)/3.25.

Suggested Citation

  • H.Y. Lau & H.F. Ting, 2001. "The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent Set," Journal of Combinatorial Optimization, Springer, vol. 5(4), pages 411-420, December.
    • Handle: RePEc:spr:jcomop:v:5:y:2001:i:4:d:10.1023_a:1011672624624
    DOI: 10.1023/A:1011672624624
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1011672624624
    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:1011672624624?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.

    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:4:d:10.1023_a:1011672624624. 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.