%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" - Job shop (Figure 7)
%U https://data.4tu.nl/articles/dataset/Benchmark_instances_for_experiments_in_Computing_all-pairs_shortest_paths_by_leveraging_low_treewidth_-_Job_shop_Figure_7_/12681050/1
%R 10.4121/uuid:16703b4f-4093-4bf8-bace-698b0a885984
%K APSP, all-pairs shortest paths
%K STN, simple temporal network
%K STP, simple temporal problem
%K shortest path
%X STNs randomly generated from the SMT-LIB "job shop" benchmark. The files from SMT-LIB are DTP instances. STNs were generated from these by randomly selecting a literal from each clause. For each STN thus generated, the graph structure was maintained while modifying the weights of the constraint arcs such that at least one solution exists (i.e. the graph contains no negative cycles and the STN is consistent). This archive contains 600 graphs on 5–241 nodes, 8–3840 arcs, upper bound on treewidth 3–62.
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