Planken, L.R.(Léon); de Weerdt, Mathijs; van der Krogt, R.P.J.(Roman) (2012): Network instance HTN, edition 2. Version 1. 4TU.ResearchData. dataset. https://doi.org/10.4121/uuid:8f914d61-a9b6-4de0-9698-e0345dabb8e4

Dataset

• Computation Theory and Mathematics

APSP, all-pairs shortest paths, shortest path, STN, simple temporal network, STP, simple temporal problem

CC BY-NC-SA 3.0

• Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2012)]

RefWorks, BibTeX, Reference Manager, Endnote, DataCite, NLM, DC, CFF

by L.R.(Léon) Planken , Mathijs de Weerdt , R.P.J.(Roman) van der Krogt

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)]

• 2012-03-09 first online, published, posted

TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group

DIMACS graph format allowing infinite arc weights media types: application/x-gzip

• http://www.worldcat.org/oclc/59274407
• https://doi.org/10.1613/jair.3509

TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group;
University College Cork; Cork Constraint Computations Centre