Network instance HTN, edition 2

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

搜集汇总

背景与挑战

背景概述

该数据集是用于'利用低树宽计算全对最短路径'论文实验的基准实例集合，包含121个生成的分层任务网络（HTN）衍生的简单时间网络（STNs）图，具有受限兄弟结构并添加地标任务，顶点数500-625，边数748-1599，树宽上限2-128，旨在支持图算法和约束满足问题的研究。