cff-version: 1.2.0
abstract: "Generated sibling-restricted STNs as they could result from a Hierarchical Task Network. Constraints exist between tasks and their children, and between sibling tasks; in addition, a limited number of "landmark" tasks is added which are exempt from this restriction. Branching factor 4–7; tree height 3–7; landmark ratio in [0,0.5]; probably of sibling edge in [0,0.5]. The weights of the constraint arcs are set such that at least one solution exists (i.e. the graph contains no negative cycles and the STN is consistent). This archive contains 121 graphs on 500–625 vertices, 748–1599 edges, upper bound on treewidth 2–128.
Parent item:
Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2012)]"
authors:
  - family-names: Planken
    given-names: L.R.(Léon)
  - family-names: de Weerdt
    given-names: Mathijs
    orcid: "https://orcid.org/0000-0002-0470-6241"
  - family-names: van der Krogt
    given-names: R.P.J.(Roman)
title: "Network instance HTN, edition 2"
keywords:
version: 1
identifiers:
  - type: doi
    value: 10.4121/uuid:8f914d61-a9b6-4de0-9698-e0345dabb8e4
license: CC BY-NC-SA 3.0
date-released: 2012-03-09