IDEAS home Printed from https://ideas.repec.org/a/spr/joheur/v30y2024i1d10.1007_s10732-023-09522-x.html
   My bibliography  Save this article

A heuristic algorithm using tree decompositions for the maximum happy vertices problem

Author

Listed:
  • Louis Carpentier

    (KU Leuven Brugge)

  • Jorik Jooken

    (KU Leuven KULAK)

  • Jan Goedgebeur

    (KU Leuven KULAK
    Ghent University)

Abstract

We propose a new methodology to develop heuristic algorithms using tree decompositions. Traditionally, such algorithms construct an optimal solution of the given problem instance through a dynamic programming approach. We modify this procedure by introducing a parameter W that dictates the number of dynamic programming states to consider. We drop the exactness guarantee in favour of a shorter running time. However, if W is large enough such that all valid states are considered, our heuristic algorithm proves optimality of the constructed solution. In particular, we implement a heuristic algorithm for the Maximum Happy Vertices problem using this approach. Our algorithm more efficiently constructs optimal solutions compared to the exact algorithm for graphs of bounded treewidth. Furthermore, our algorithm constructs higher quality solutions than state-of-the-art heuristic algorithms Greedy-MHV and Growth-MHV for instances of which at least 40% of the vertices are initially coloured, at the cost of a larger running time.

Suggested Citation

  • Louis Carpentier & Jorik Jooken & Jan Goedgebeur, 2024. "A heuristic algorithm using tree decompositions for the maximum happy vertices problem," Journal of Heuristics, Springer, vol. 30(1), pages 67-107, April.
    • Handle: RePEc:spr:joheur:v:30:y:2024:i:1:d:10.1007_s10732-023-09522-x
    DOI: 10.1007/s10732-023-09522-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10732-023-09522-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10732-023-09522-x?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:joheur:v:30:y:2024:i:1:d:10.1007_s10732-023-09522-x. 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.