IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v37y2019i4d10.1007_s10878-018-0353-z.html
   My bibliography  Save this article

Positive-instance driven dynamic programming for treewidth

Author

Listed:
  • Hisao Tamaki

    (Meiji University)

Abstract

Consider a dynamic programming scheme for a decision problem in which all subproblems involved are also decision problems. An implementation of such a scheme is positive-instance driven (PID), if it generates positive subproblem instances, but not negative ones, building each on smaller positive instances. We take the dynamic programming scheme due to Bouchitté and Todinca for treewidth computation, which is based on minimal separators and potential maximal cliques, and design a variant (for the decision version of the problem) with a natural PID implementation. The resulting algorithm performs extremely well: it solves a number of standard benchmark instances for which the optimal solutions have not previously been known. Incorporating a new heuristic algorithm for detecting safe separators, it also solves all of the 100 public instances posed by the exact treewidth track in PACE 2017, a competition on algorithm implementation. We describe the algorithm, prove its correctness, and give a running time bound in terms of the number of positive subproblem instances. We perform an experimental analysis which supports the practical importance of such a bound.

Suggested Citation

  • Hisao Tamaki, 2019. "Positive-instance driven dynamic programming for treewidth," Journal of Combinatorial Optimization, Springer, vol. 37(4), pages 1283-1311, May.
    • Handle: RePEc:spr:jcomop:v:37:y:2019:i:4:d:10.1007_s10878-018-0353-z
    DOI: 10.1007/s10878-018-0353-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-018-0353-z
    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/s10878-018-0353-z?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. Tom C. van der Zanden & Hans L. Bodlaender & Herbert J. M. Hamers, 2023. "Efficiently computing the Shapley value of connectivity games in low-treewidth graphs," Operational Research, Springer, vol. 23(1), pages 1-23, March.
    2. Niels Lindner & Julian Reisch, 2022. "An analysis of the parameterized complexity of periodic timetabling," Journal of Scheduling, Springer, vol. 25(2), pages 157-176, April.

    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:37:y:2019:i:4:d:10.1007_s10878-018-0353-z. 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.