uuid;88fd82f1-febe-4797-b97a-e4ee0306fa48.tgz (106.4 kB)

Benchmark instances for experiments in "Computing all-pairs shortest paths by leveraging low treewidth" - Diamonds (Figure 5)

Download (106.4 kB)
dataset
posted on 15.03.2011 by L.R.(Léon) Planken, M.M.(Mathijs) de Weerdt, R.P.J.(Roman) van der Krogt
STNs randomly generated from the SMT-LIB "diamonds" 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 504 graphs on 51–379 nodes, 49–379 arcs, upper bound on treewidth 2. Parent item: Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2011)]

History

Contributors

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

Publisher

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

Format

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

Exports