%0 Generic
%A Planken, L.R.(Léon)
%A de Weerdt, Mathijs
%A van der Krogt, R.P.J.(Roman)
%D 2011
%T Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - HTN (Figure 8)
%U https://data.4tu.nl/articles/dataset/Benchmark_instances_for_experiments_in_Computing_all-pairs_shortest_paths_by_leveraging_low_treewidth_-_HTN_Figure_8_/12688016/1
%R 10.4121/uuid:2fea9297-0bbf-4529-814d-f97392e4f81e
%K APSP, all-pairs shortest paths
%K STN, simple temporal network
%K STP, simple temporal problem
%K shortest path
%X 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 nodes, 748–1515 arcs, upper bound on treewidth 2–144.
Parent item:
Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2011)]
%I TU Delft - Delft University of Technology; Faculty EEMCS; Algorithmics group