Planken, L.R.(Léon); de Weerdt, Mathijs; van der Krogt, R.P.J.(Roman) (2012): Network instance Diamonds, edition 2. Version 1. 4TU.ResearchData. dataset. https://doi.org/10.4121/uuid:6cad8a1b-88db-4a64-97eb-b4f3f1a87047

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

STNs randomly generated in the SMT-LIB "diamonds" benchmark category. The benchmarks 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 130 graphs on 111–2751 vertices, 111–2751 edges, upper bound on treewidth 2. 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.smt-lib.org/
• https://doi.org/10.1613/jair.3509

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